About the Execution of 2023-gold 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.392 | 3600000.00 | 4252800.00 | 468847.60 | FTT?FFT?FFFT??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/mcc2024-input.r087-tall-171620521800233.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r087-tall-171620521800233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 591K May 18 16:42 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 1716252557987
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 00:49:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 00:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 00:49:19] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-21 00:49:19] [INFO ] Transformed 1536 places.
[2024-05-21 00:49:19] [INFO ] Transformed 768 transitions.
[2024-05-21 00:49:19] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CircularTrains-PT-768-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 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 157 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2024-05-21 00:49:20] [INFO ] Computed 769 invariants in 87 ms
[2024-05-21 00:49:21] [INFO ] Implicit Places using invariants in 1570 ms returned [3, 14, 18, 29, 35, 45, 47, 59, 75, 79, 81, 83, 85, 90, 94, 96, 102, 106, 110, 125, 128, 138, 144, 149, 150, 152, 155, 158, 163, 173, 180, 187, 193, 196, 197, 198, 224, 228, 243, 244, 247, 248, 250, 255, 259, 273, 276, 296, 304, 312, 318, 325, 330, 333, 350, 353, 355, 368, 380, 381, 389, 402, 409, 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, 839, 843, 846, 856, 872, 874, 883, 884, 885, 905, 929, 934, 940, 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, 1153, 1157, 1160, 1162, 1163, 1168, 1178, 1182, 1185, 1198, 1204, 1209, 1211, 1216, 1228, 1229, 1244, 1247, 1252, 1261, 1262, 1266, 1273, 1292, 1299, 1300, 1301, 1305, 1306, 1329, 1335, 1337, 1338, 1339, 1350, 1354, 1356, 1360, 1362, 1373, 1378, 1379, 1385, 1391, 1430, 1438, 1446, 1450, 1453, 1461, 1472, 1476, 1484, 1485, 1487, 1488, 1493, 1495, 1497, 1507, 1512, 1513, 1515, 1517, 1525, 1527, 1531]
Discarding 249 places :
Implicit Place search using SMT only with invariants took 1719 ms to find 249 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1287/1536 places, 768/768 transitions.
Applied a total of 0 rules in 106 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1982 ms. Remains : 1287/1536 places, 768/768 transitions.
Support contains 56 out of 1287 places after structural reductions.
[2024-05-21 00:49:21] [INFO ] Flatten gal took : 88 ms
[2024-05-21 00:49:22] [INFO ] Flatten gal took : 49 ms
[2024-05-21 00:49:22] [INFO ] Input system was already deterministic with 768 transitions.
Support contains 54 out of 1287 places (down from 56) after GAL structural reductions.
Finished random walk after 4867 steps, including 1 resets, run visited all 27 properties in 249 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||F(p1)))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 45 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 00:49:22] [INFO ] Computed 520 invariants in 40 ms
[2024-05-21 00:49:23] [INFO ] Implicit Places using invariants in 765 ms returned [92, 285, 304, 794, 968, 1183]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 769 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1287 places, 768/768 transitions.
Applied a total of 0 rules in 53 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 867 ms. Remains : 1281/1287 places, 768/768 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(OR (LT s830 1) (LT s1134 1)), p0:(AND (GEQ s479 1) (GEQ s740 1) (GEQ s31 1) (GEQ s1018 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 464 reset in 4026 ms.
Product exploration explored 100000 steps with 454 reset in 4133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 00:49:33] [INFO ] Computed 514 invariants in 25 ms
[2024-05-21 00:49:33] [INFO ] [Real]Absence check using 510 positive place invariants in 81 ms returned sat
[2024-05-21 00:49:33] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 00:49:34] [INFO ] After 806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 00:49:34] [INFO ] [Nat]Absence check using 510 positive place invariants in 128 ms returned sat
[2024-05-21 00:49:34] [INFO ] [Nat]Absence check using 510 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 00:49:34] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 00:49:34] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-21 00:49:35] [INFO ] After 919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 355 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 21 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 230 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-21 00:49:35] [INFO ] Invariant cache hit.
[2024-05-21 00:49:36] [INFO ] [Real]Absence check using 510 positive place invariants in 304 ms returned sat
[2024-05-21 00:49:36] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 105 ms returned sat
[2024-05-21 00:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:49:44] [INFO ] [Real]Absence check using state equation in 7792 ms returned sat
[2024-05-21 00:49:44] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-21 00:49:50] [INFO ] Added : 105 causal constraints over 21 iterations in 6021 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
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.
[2024-05-21 00:49:50] [INFO ] Invariant cache hit.
[2024-05-21 00:49:51] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-21 00:49:51] [INFO ] Invariant cache hit.
[2024-05-21 00:49:52] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
[2024-05-21 00:49:52] [INFO ] Invariant cache hit.
[2024-05-21 00:49:53] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2458 ms. 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 (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4337 steps, including 1 resets, run visited all 3 properties in 135 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-21 00:49:54] [INFO ] Invariant cache hit.
[2024-05-21 00:49:55] [INFO ] [Real]Absence check using 510 positive place invariants in 321 ms returned sat
[2024-05-21 00:49:55] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 106 ms returned sat
[2024-05-21 00:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:50:03] [INFO ] [Real]Absence check using state equation in 7836 ms returned sat
[2024-05-21 00:50:03] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-21 00:50:09] [INFO ] Added : 105 causal constraints over 21 iterations in 6066 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 447 reset in 3825 ms.
Product exploration explored 100000 steps with 443 reset in 4050 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (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 1 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 1 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 248 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 00:50:18] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 00:50:18] [INFO ] Computed 514 invariants in 14 ms
[2024-05-21 00:50:18] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 768/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 782 ms. Remains : 1281/1281 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin1498814615478261897
[2024-05-21 00:50:18] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1498814615478261897
Running compilation step : cd /tmp/ltsmin1498814615478261897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1563 ms.
Running link step : cd /tmp/ltsmin1498814615478261897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1498814615478261897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14582160874815837376.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 39 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 00:50:33] [INFO ] Computed 514 invariants in 11 ms
[2024-05-21 00:50:34] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-21 00:50:34] [INFO ] Invariant cache hit.
[2024-05-21 00:50:35] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
[2024-05-21 00:50:35] [INFO ] Invariant cache hit.
[2024-05-21 00:50:36] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2398 ms. Remains : 1281/1281 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin296040793454974129
[2024-05-21 00:50:36] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin296040793454974129
Running compilation step : cd /tmp/ltsmin296040793454974129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1347 ms.
Running link step : cd /tmp/ltsmin296040793454974129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin296040793454974129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17750501122541295634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 00:50:51] [INFO ] Flatten gal took : 40 ms
[2024-05-21 00:50:51] [INFO ] Flatten gal took : 40 ms
[2024-05-21 00:50:51] [INFO ] Time to serialize gal into /tmp/LTL17512026983918313096.gal : 7 ms
[2024-05-21 00:50:51] [INFO ] Time to serialize properties into /tmp/LTL3341934018290549701.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17512026983918313096.gal' '-t' 'CGAL' '-hoa' '/tmp/aut223647210267755012.hoa' '-atoms' '/tmp/LTL3341934018290549701.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3341934018290549701.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut223647210267755012.hoa
Detected timeout of ITS tools.
[2024-05-21 00:51:06] [INFO ] Flatten gal took : 34 ms
[2024-05-21 00:51:06] [INFO ] Flatten gal took : 31 ms
[2024-05-21 00:51:06] [INFO ] Time to serialize gal into /tmp/LTL2413333802034190499.gal : 5 ms
[2024-05-21 00:51:06] [INFO ] Time to serialize properties into /tmp/LTL1332485014280583084.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2413333802034190499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1332485014280583084.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))")))))||(F("((Section_666<1)||(F667<1))"))))
Formula 0 simplified : XXXF!"(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))" & G!"((Section_666<1)||(F667<1))"
Detected timeout of ITS tools.
[2024-05-21 00:51:21] [INFO ] Flatten gal took : 47 ms
[2024-05-21 00:51:21] [INFO ] Applying decomposition
[2024-05-21 00:51:21] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17824185583214865073.txt' '-o' '/tmp/graph17824185583214865073.bin' '-w' '/tmp/graph17824185583214865073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17824185583214865073.bin' '-l' '-1' '-v' '-w' '/tmp/graph17824185583214865073.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:51:22] [INFO ] Decomposing Gal with order
[2024-05-21 00:51:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:51:22] [INFO ] Flatten gal took : 99 ms
[2024-05-21 00:51:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 00:51:22] [INFO ] Time to serialize gal into /tmp/LTL15962916011104579431.gal : 10 ms
[2024-05-21 00:51:22] [INFO ] Time to serialize properties into /tmp/LTL10368754124042775156.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15962916011104579431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10368754124042775156.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((i8.i1.i0.u23.Section_277>=1)&&(i8.i1.i0.u145.F278>=1))&&((i22.u185.F573>=1)&&(i22.u100.Section_572>=1)))")))))||(F("((...213
Formula 0 simplified : XXXF!"(((i8.i1.i0.u23.Section_277>=1)&&(i8.i1.i0.u145.F278>=1))&&((i22.u185.F573>=1)&&(i22.u100.Section_572>=1)))" & G!"((i19.i1.i1....199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4679378265130319714
[2024-05-21 00:51:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4679378265130319714
Running compilation step : cd /tmp/ltsmin4679378265130319714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1345 ms.
Running link step : cd /tmp/ltsmin4679378265130319714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4679378265130319714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(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-03 finished in 149831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(p0)) U p1))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1048 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 480 place count 1047 transition count 519
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 86 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 00:51:52] [INFO ] Computed 520 invariants in 11 ms
[2024-05-21 00:51:53] [INFO ] Implicit Places using invariants in 756 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 757 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 32 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 876 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s39 1) (GEQ s818 1)), p0:(AND (GEQ s170 1) (GEQ s903 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2991 ms.
Product exploration explored 100000 steps with 0 reset in 3229 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 375 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 990 steps, including 0 resets, run visited all 5 properties in 42 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 473 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 00:52:01] [INFO ] Computed 513 invariants in 16 ms
[2024-05-21 00:52:02] [INFO ] [Real]Absence check using 511 positive place invariants in 274 ms returned sat
[2024-05-21 00:52:02] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-21 00:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:52:07] [INFO ] [Real]Absence check using state equation in 5146 ms returned sat
[2024-05-21 00:52:07] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 00:52:16] [INFO ] Added : 130 causal constraints over 26 iterations in 9117 ms. Result :unknown
Could not prove EG (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 30 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 00:52:16] [INFO ] Invariant cache hit.
[2024-05-21 00:52:17] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-21 00:52:17] [INFO ] Invariant cache hit.
[2024-05-21 00:52:18] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
[2024-05-21 00:52:18] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 00:52:18] [INFO ] Invariant cache hit.
[2024-05-21 00:52:18] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2009 ms. 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 405 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 456 steps, including 0 resets, run visited all 5 properties in 26 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 585 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2024-05-21 00:52:20] [INFO ] Invariant cache hit.
[2024-05-21 00:52:21] [INFO ] [Real]Absence check using 511 positive place invariants in 283 ms returned sat
[2024-05-21 00:52:21] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-21 00:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:52:26] [INFO ] [Real]Absence check using state equation in 5182 ms returned sat
[2024-05-21 00:52:26] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-21 00:52:35] [INFO ] Added : 130 causal constraints over 26 iterations in 9046 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 3070 ms.
Product exploration explored 100000 steps with 0 reset in 3473 ms.
Built C files in :
/tmp/ltsmin1605714903328842502
[2024-05-21 00:52:42] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 00:52:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:52:42] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 00:52:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:52:42] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 00:52:42] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:52:42] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1605714903328842502
Running compilation step : cd /tmp/ltsmin1605714903328842502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1295 ms.
Running link step : cd /tmp/ltsmin1605714903328842502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1605714903328842502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7555485131166521595.hoa' '--buchi-type=spotba'
LTSmin run took 11291 ms.
FORMULA CircularTrains-PT-768-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-04 finished in 62564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (F(p1) U G(p2))))))'
Support contains 8 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 43 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 00:52:55] [INFO ] Computed 520 invariants in 13 ms
[2024-05-21 00:52:55] [INFO ] Implicit Places using invariants in 792 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 794 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 877 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s389 1) (GEQ s513 1) (GEQ s856 1) (GEQ s863 1)), p0:(AND (GEQ s18 1) (GEQ s676 1)), p1:(AND (GEQ s345 1) (GEQ s1231 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 160 reset in 3553 ms.
Product exploration explored 100000 steps with 166 reset in 3776 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) p0 (NOT p1)), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 234 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Finished random walk after 7312 steps, including 2 resets, run visited all 7 properties in 273 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 400 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 00:53:05] [INFO ] Computed 513 invariants in 13 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 2 factoid took 426 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-768-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-768-LTLFireability-05 finished in 11628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 44 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 00:53:06] [INFO ] Computed 520 invariants in 13 ms
[2024-05-21 00:53:07] [INFO ] Implicit Places using invariants in 812 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 813 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 896 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s732 1) (GEQ s1045 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 20184 reset in 3536 ms.
Product exploration explored 100000 steps with 19990 reset in 3781 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 229 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
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 215 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 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.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 00:53:16] [INFO ] Computed 513 invariants in 17 ms
[2024-05-21 00:53:17] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-21 00:53:17] [INFO ] Invariant cache hit.
[2024-05-21 00:53:18] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2024-05-21 00:53:18] [INFO ] Invariant cache hit.
[2024-05-21 00:53:18] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2518 ms. Remains : 1280/1280 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 147 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 92 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
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 191 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17671 reset in 3533 ms.
Product exploration explored 100000 steps with 21375 reset in 3762 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 256 rules applied. Total rules applied 256 place count 1280 transition count 768
Deduced a syphon composed of 256 places in 0 ms
Applied a total of 256 rules in 73 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 00:53:27] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 00:53:27] [INFO ] Computed 513 invariants in 15 ms
[2024-05-21 00:53:28] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1280/1280 places, 768/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 628 ms. Remains : 1280/1280 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin3353802850123356148
[2024-05-21 00:53:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3353802850123356148
Running compilation step : cd /tmp/ltsmin3353802850123356148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1432 ms.
Running link step : cd /tmp/ltsmin3353802850123356148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3353802850123356148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2809897929625066497.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 47 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 00:53:43] [INFO ] Computed 513 invariants in 12 ms
[2024-05-21 00:53:44] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-21 00:53:44] [INFO ] Invariant cache hit.
[2024-05-21 00:53:45] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-21 00:53:45] [INFO ] Invariant cache hit.
[2024-05-21 00:53:45] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2580 ms. Remains : 1280/1280 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin9191913947010406109
[2024-05-21 00:53:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9191913947010406109
Running compilation step : cd /tmp/ltsmin9191913947010406109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1402 ms.
Running link step : cd /tmp/ltsmin9191913947010406109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9191913947010406109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11127638171067434339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 00:54:01] [INFO ] Flatten gal took : 34 ms
[2024-05-21 00:54:01] [INFO ] Flatten gal took : 25 ms
[2024-05-21 00:54:01] [INFO ] Time to serialize gal into /tmp/LTL14339548026296636480.gal : 5 ms
[2024-05-21 00:54:01] [INFO ] Time to serialize properties into /tmp/LTL1031331154483048260.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14339548026296636480.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5620562915194878513.hoa' '-atoms' '/tmp/LTL1031331154483048260.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1031331154483048260.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5620562915194878513.hoa
Detected timeout of ITS tools.
[2024-05-21 00:54:16] [INFO ] Flatten gal took : 23 ms
[2024-05-21 00:54:16] [INFO ] Flatten gal took : 22 ms
[2024-05-21 00:54:16] [INFO ] Time to serialize gal into /tmp/LTL1453070263963127914.gal : 4 ms
[2024-05-21 00:54:16] [INFO ] Time to serialize properties into /tmp/LTL18354129528008368293.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1453070263963127914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18354129528008368293.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((Section_675>=1)&&(F676>=1))"))))
Formula 0 simplified : XG!"((Section_675>=1)&&(F676>=1))"
Detected timeout of ITS tools.
[2024-05-21 00:54:31] [INFO ] Flatten gal took : 22 ms
[2024-05-21 00:54:31] [INFO ] Applying decomposition
[2024-05-21 00:54:31] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2020197827448960978.txt' '-o' '/tmp/graph2020197827448960978.bin' '-w' '/tmp/graph2020197827448960978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2020197827448960978.bin' '-l' '-1' '-v' '-w' '/tmp/graph2020197827448960978.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:54:31] [INFO ] Decomposing Gal with order
[2024-05-21 00:54:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:54:31] [INFO ] Flatten gal took : 31 ms
[2024-05-21 00:54:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 00:54:31] [INFO ] Time to serialize gal into /tmp/LTL11561954458395936617.gal : 8 ms
[2024-05-21 00:54:31] [INFO ] Time to serialize properties into /tmp/LTL6548340469184245161.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11561954458395936617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6548340469184245161.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("((i8.i1.i0.u23.Section_675>=1)&&(i8.i1.i0.u23.F676>=1))"))))
Formula 0 simplified : XG!"((i8.i1.i0.u23.Section_675>=1)&&(i8.i1.i0.u23.F676>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18121683442962639268
[2024-05-21 00:54:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18121683442962639268
Running compilation step : cd /tmp/ltsmin18121683442962639268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1458 ms.
Running link step : cd /tmp/ltsmin18121683442962639268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18121683442962639268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 114859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&G(F(p2)))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 00:55:01] [INFO ] Computed 520 invariants in 12 ms
[2024-05-21 00:55:02] [INFO ] Implicit Places using invariants in 814 ms returned [92, 285, 304, 743, 794, 968]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 816 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1287 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 LTL mode , in 2 iterations and 896 ms. Remains : 1281/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s396 1) (LT s426 1)), p1:(AND (GEQ s1022 1) (GEQ s1177 1)), p2:(OR (AND (GEQ s396 1) (GEQ s426 1)) (AND (GEQ s928 1) (GEQ s1180 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 2982 ms.
Product exploration explored 100000 steps with 0 reset in 3237 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) p2), (X p2), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), false, false]
Finished random walk after 3005 steps, including 0 resets, run visited all 6 properties in 113 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT p2)), (F (AND p0 p2 p1)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 404 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter insensitive) to 7 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), false, false]
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 00:55:11] [INFO ] Computed 514 invariants in 13 ms
[2024-05-21 00:55:11] [INFO ] [Real]Absence check using 511 positive place invariants in 309 ms returned sat
[2024-05-21 00:55:12] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 150 ms returned sat
[2024-05-21 00:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:55:18] [INFO ] [Real]Absence check using state equation in 6662 ms returned sat
[2024-05-21 00:55:18] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-21 00:55:26] [INFO ] Added : 90 causal constraints over 18 iterations in 7242 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-21 00:55:26] [INFO ] Invariant cache hit.
[2024-05-21 00:55:26] [INFO ] [Real]Absence check using 511 positive place invariants in 313 ms returned sat
[2024-05-21 00:55:27] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 134 ms returned sat
[2024-05-21 00:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:55:30] [INFO ] [Real]Absence check using state equation in 3743 ms returned sat
[2024-05-21 00:55:31] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-21 00:55:41] [INFO ] Added : 165 causal constraints over 33 iterations in 10165 ms. Result :unknown
Could not prove EG (NOT p1)
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.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1281 transition count 516
Reduce places removed 252 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 254 rules applied. Total rules applied 506 place count 1029 transition count 514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 508 place count 1027 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 1026 transition count 513
Applied a total of 510 rules in 66 ms. Remains 1026 /1281 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2024-05-21 00:55:41] [INFO ] Computed 514 invariants in 12 ms
[2024-05-21 00:55:41] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-21 00:55:41] [INFO ] Invariant cache hit.
[2024-05-21 00:55:42] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-05-21 00:55:42] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 00:55:42] [INFO ] Invariant cache hit.
[2024-05-21 00:55:43] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1281 places, 513/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2119 ms. Remains : 1026/1281 places, 513/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)), (X p2), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 381 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter insensitive) to 7 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), false, false]
Finished random walk after 2471 steps, including 0 resets, run visited all 6 properties in 105 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT p2)), (F (AND p0 p2 p1)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 539 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter insensitive) to 7 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), false, false]
[2024-05-21 00:55:45] [INFO ] Invariant cache hit.
[2024-05-21 00:55:46] [INFO ] [Real]Absence check using 511 positive place invariants in 288 ms returned sat
[2024-05-21 00:55:46] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 128 ms returned sat
[2024-05-21 00:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:55:49] [INFO ] [Real]Absence check using state equation in 3133 ms returned sat
[2024-05-21 00:55:49] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-21 00:56:00] [INFO ] Added : 190 causal constraints over 38 iterations in 11013 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-21 00:56:00] [INFO ] Invariant cache hit.
[2024-05-21 00:56:01] [INFO ] [Real]Absence check using 511 positive place invariants in 274 ms returned sat
[2024-05-21 00:56:01] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 131 ms returned sat
[2024-05-21 00:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:56:05] [INFO ] [Real]Absence check using state equation in 4168 ms returned sat
[2024-05-21 00:56:05] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-21 00:56:15] [INFO ] Added : 205 causal constraints over 41 iterations in 9990 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 2 reset in 2966 ms.
Product exploration explored 100000 steps with 1 reset in 3276 ms.
Built C files in :
/tmp/ltsmin3553605467675753826
[2024-05-21 00:56:22] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 00:56:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:56:22] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 00:56:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:56:22] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 00:56:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:56:22] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3553605467675753826
Running compilation step : cd /tmp/ltsmin3553605467675753826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1396 ms.
Running link step : cd /tmp/ltsmin3553605467675753826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3553605467675753826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14935528711616635215.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 40 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 00:56:37] [INFO ] Invariant cache hit.
[2024-05-21 00:56:37] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-05-21 00:56:37] [INFO ] Invariant cache hit.
[2024-05-21 00:56:38] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2024-05-21 00:56:38] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 00:56:38] [INFO ] Invariant cache hit.
[2024-05-21 00:56:39] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2109 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin5110239786290496966
[2024-05-21 00:56:39] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 00:56:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:56:39] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 00:56:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:56:39] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 00:56:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:56:39] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5110239786290496966
Running compilation step : cd /tmp/ltsmin5110239786290496966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1260 ms.
Running link step : cd /tmp/ltsmin5110239786290496966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5110239786290496966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5781310459881338263.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 00:56:54] [INFO ] Flatten gal took : 18 ms
[2024-05-21 00:56:54] [INFO ] Flatten gal took : 18 ms
[2024-05-21 00:56:54] [INFO ] Time to serialize gal into /tmp/LTL1424626429164368238.gal : 3 ms
[2024-05-21 00:56:54] [INFO ] Time to serialize properties into /tmp/LTL13884518649966135794.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1424626429164368238.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14665879156086605886.hoa' '-atoms' '/tmp/LTL13884518649966135794.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13884518649966135794.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14665879156086605886.hoa
Detected timeout of ITS tools.
[2024-05-21 00:57:09] [INFO ] Flatten gal took : 18 ms
[2024-05-21 00:57:09] [INFO ] Flatten gal took : 18 ms
[2024-05-21 00:57:09] [INFO ] Time to serialize gal into /tmp/LTL16238237870280141720.gal : 3 ms
[2024-05-21 00:57:09] [INFO ] Time to serialize properties into /tmp/LTL8630336037114557699.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16238237870280141720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8630336037114557699.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(("((F403<1)||(Section_402<1))")&&(G("((Section_97>=1)&&(F98>=1))"))))&&(G(F("(((F403>=1)&&(Section_402>=1))||((Section_294>=1)...175
Formula 0 simplified : X(G(!"((F403<1)||(Section_402<1))" | F!"((Section_97>=1)&&(F98>=1))") | FG!"(((F403>=1)&&(Section_402>=1))||((Section_294>=1)&&(F295...163
Detected timeout of ITS tools.
[2024-05-21 00:57:24] [INFO ] Flatten gal took : 17 ms
[2024-05-21 00:57:24] [INFO ] Applying decomposition
[2024-05-21 00:57:24] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph196291014540983975.txt' '-o' '/tmp/graph196291014540983975.bin' '-w' '/tmp/graph196291014540983975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph196291014540983975.bin' '-l' '-1' '-v' '-w' '/tmp/graph196291014540983975.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:57:24] [INFO ] Decomposing Gal with order
[2024-05-21 00:57:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:57:24] [INFO ] Flatten gal took : 47 ms
[2024-05-21 00:57:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:57:24] [INFO ] Time to serialize gal into /tmp/LTL4678344359046259150.gal : 25 ms
[2024-05-21 00:57:24] [INFO ] Time to serialize properties into /tmp/LTL8142677939119535149.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4678344359046259150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8142677939119535149.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F(("((i4.u359.F403<1)||(i4.u164.Section_402<1))")&&(G("((i23.u89.Section_97>=1)&&(i23.u89.F98>=1))"))))&&(G(F("(((i4.u359.F403>=...259
Formula 0 simplified : X(G(!"((i4.u359.F403<1)||(i4.u164.Section_402<1))" | F!"((i23.u89.Section_97>=1)&&(i23.u89.F98>=1))") | FG!"(((i4.u359.F403>=1)&&(i4...247
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16081943562721642527
[2024-05-21 00:57:39] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16081943562721642527
Running compilation step : cd /tmp/ltsmin16081943562721642527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 936 ms.
Running link step : cd /tmp/ltsmin16081943562721642527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16081943562721642527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 8725 ms.
FORMULA CircularTrains-PT-768-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 168073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 242 rules applied. Total rules applied 482 place count 1047 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 91 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 00:57:49] [INFO ] Computed 520 invariants in 13 ms
[2024-05-21 00:57:50] [INFO ] Implicit Places using invariants in 685 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 687 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 805 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s299 1) (GEQ s498 1))) (NOT (AND (GEQ s195 1) (GEQ s991 1)))), p1:(AND (GEQ s195 1) (GEQ s991 1)), p0:(OR (LT s299 1) (LT s498 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 341 reset in 3983 ms.
Product exploration explored 100000 steps with 332 reset in 4235 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) p1 (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge based reduction with 3 factoid took 337 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 00:58:00] [INFO ] Computed 513 invariants in 14 ms
[2024-05-21 00:58:00] [INFO ] After 105ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 501 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Stuttering acceptance computed with spot in 81 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
[2024-05-21 00:58:00] [INFO ] Invariant cache hit.
[2024-05-21 00:58:01] [INFO ] [Real]Absence check using 511 positive place invariants in 286 ms returned sat
[2024-05-21 00:58:01] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 61 ms returned sat
[2024-05-21 00:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:58:07] [INFO ] [Real]Absence check using state equation in 5773 ms returned sat
[2024-05-21 00:58:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:58:08] [INFO ] [Nat]Absence check using 511 positive place invariants in 338 ms returned sat
[2024-05-21 00:58:08] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-21 00:58:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 00:58:10] [INFO ] [Nat]Absence check using state equation in 2207 ms returned sat
[2024-05-21 00:58:10] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-21 00:58:13] [INFO ] Added : 254 causal constraints over 51 iterations in 2904 ms. Result :sat
Could not prove EG (AND p1 (NOT p2) (NOT p0))
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 32 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 00:58:13] [INFO ] Invariant cache hit.
[2024-05-21 00:58:14] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-21 00:58:14] [INFO ] Invariant cache hit.
[2024-05-21 00:58:15] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1675 ms to find 0 implicit places.
[2024-05-21 00:58:15] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 00:58:15] [INFO ] Invariant cache hit.
[2024-05-21 00:58:15] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2083 ms. 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 p1 (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 326 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Finished random walk after 769 steps, including 0 resets, run visited all 4 properties in 33 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 446 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Stuttering acceptance computed with spot in 78 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
[2024-05-21 00:58:17] [INFO ] Invariant cache hit.
[2024-05-21 00:58:17] [INFO ] [Real]Absence check using 511 positive place invariants in 275 ms returned sat
[2024-05-21 00:58:17] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 60 ms returned sat
[2024-05-21 00:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:58:23] [INFO ] [Real]Absence check using state equation in 5799 ms returned sat
[2024-05-21 00:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:58:24] [INFO ] [Nat]Absence check using 511 positive place invariants in 275 ms returned sat
[2024-05-21 00:58:24] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 93 ms returned sat
[2024-05-21 00:58:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 00:58:26] [INFO ] [Nat]Absence check using state equation in 2020 ms returned sat
[2024-05-21 00:58:26] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-21 00:58:29] [INFO ] Added : 254 causal constraints over 51 iterations in 2868 ms. Result :sat
Could not prove EG (AND p1 (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 78 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Product exploration explored 100000 steps with 339 reset in 3943 ms.
Product exploration explored 100000 steps with 336 reset in 4205 ms.
Built C files in :
/tmp/ltsmin12120439306657325326
[2024-05-21 00:58:37] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 00:58:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:58:37] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 00:58:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:58:37] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 00:58:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:58:37] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12120439306657325326
Running compilation step : cd /tmp/ltsmin12120439306657325326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1246 ms.
Running link step : cd /tmp/ltsmin12120439306657325326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12120439306657325326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8127707370520885619.hoa' '--buchi-type=spotba'
LTSmin run took 11087 ms.
FORMULA CircularTrains-PT-768-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-10 finished in 60412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1287 transition count 526
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 484 place count 1045 transition count 520
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 67 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-21 00:58:50] [INFO ] Computed 520 invariants in 11 ms
[2024-05-21 00:58:50] [INFO ] Implicit Places using invariants in 709 ms returned [76, 227, 242, 594, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 710 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 27 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 805 ms. Remains : 1026/1287 places, 513/768 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s375 1) (GEQ s632 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 514 reset in 4017 ms.
Product exploration explored 100000 steps with 590 reset in 4300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 513 rows 1026 cols
[2024-05-21 00:59:00] [INFO ] Computed 514 invariants in 12 ms
[2024-05-21 00:59:00] [INFO ] [Real]Absence check using 510 positive place invariants in 274 ms returned sat
[2024-05-21 00:59:01] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 111 ms returned sat
[2024-05-21 00:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:59:02] [INFO ] [Real]Absence check using state equation in 1730 ms returned sat
[2024-05-21 00:59:02] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 00:59:15] [INFO ] Added : 250 causal constraints over 50 iterations in 12421 ms. Result :unknown
Could not prove EG (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 32 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 00:59:15] [INFO ] Invariant cache hit.
[2024-05-21 00:59:15] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-05-21 00:59:15] [INFO ] Invariant cache hit.
[2024-05-21 00:59:16] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1687 ms to find 0 implicit places.
[2024-05-21 00:59:16] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 00:59:16] [INFO ] Invariant cache hit.
[2024-05-21 00:59:17] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2108 ms. 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 162 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-21 00:59:18] [INFO ] Invariant cache hit.
[2024-05-21 00:59:19] [INFO ] [Real]Absence check using 510 positive place invariants in 285 ms returned sat
[2024-05-21 00:59:19] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 84 ms returned sat
[2024-05-21 00:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:59:22] [INFO ] [Real]Absence check using state equation in 3698 ms returned sat
[2024-05-21 00:59:22] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 00:59:32] [INFO ] Added : 254 causal constraints over 51 iterations in 9826 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 567 reset in 4021 ms.
Product exploration explored 100000 steps with 500 reset in 4218 ms.
Built C files in :
/tmp/ltsmin16625237888087668597
[2024-05-21 00:59:41] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 00:59:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:59:41] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 00:59:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:59:41] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 00:59:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:59:41] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16625237888087668597
Running compilation step : cd /tmp/ltsmin16625237888087668597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1253 ms.
Running link step : cd /tmp/ltsmin16625237888087668597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16625237888087668597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3346814468292535608.hoa' '--buchi-type=spotba'
LTSmin run took 13090 ms.
FORMULA CircularTrains-PT-768-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-11 finished in 65383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(F((p2||G(!p1)))))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 00:59:55] [INFO ] Computed 520 invariants in 11 ms
[2024-05-21 00:59:56] [INFO ] Implicit Places using invariants in 804 ms returned [92, 743, 794, 968, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 805 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1287 places, 768/768 transitions.
Applied a total of 0 rules in 48 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 892 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s284 1) (LT s1191 1)), p1:(OR (LT s303 1) (LT s621 1)), p2:(AND (GEQ s271 1) (GEQ s1017 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 195 reset in 3629 ms.
Product exploration explored 100000 steps with 179 reset in 3798 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 586 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Finished random walk after 729 steps, including 0 resets, run visited all 4 properties in 36 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 630 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 171 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 01:00:06] [INFO ] Computed 515 invariants in 14 ms
[2024-05-21 01:00:07] [INFO ] [Real]Absence check using 511 positive place invariants in 325 ms returned sat
[2024-05-21 01:00:07] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 37 ms returned sat
[2024-05-21 01:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:00:12] [INFO ] [Real]Absence check using state equation in 5147 ms returned sat
[2024-05-21 01:00:12] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-21 01:00:20] [INFO ] Added : 509 causal constraints over 102 iterations in 8262 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 4 out of 1282 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1282 transition count 518
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 1032 transition count 518
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 500 place count 1032 transition count 516
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 504 place count 1030 transition count 516
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 508 place count 1028 transition count 514
Applied a total of 508 rules in 58 ms. Remains 1028 /1282 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1028 cols
[2024-05-21 01:00:20] [INFO ] Computed 515 invariants in 13 ms
[2024-05-21 01:00:21] [INFO ] Implicit Places using invariants in 692 ms returned []
[2024-05-21 01:00:21] [INFO ] Invariant cache hit.
[2024-05-21 01:00:22] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2024-05-21 01:00:22] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 01:00:22] [INFO ] Invariant cache hit.
[2024-05-21 01:00:22] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1028/1282 places, 514/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2079 ms. Remains : 1028/1282 places, 514/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 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 312 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Finished random walk after 864 steps, including 0 resets, run visited all 4 properties in 45 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-05-21 01:00:24] [INFO ] Invariant cache hit.
[2024-05-21 01:00:25] [INFO ] [Real]Absence check using 511 positive place invariants in 285 ms returned sat
[2024-05-21 01:00:25] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 66 ms returned sat
[2024-05-21 01:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:00:29] [INFO ] [Real]Absence check using state equation in 4184 ms returned sat
[2024-05-21 01:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:00:30] [INFO ] [Nat]Absence check using 511 positive place invariants in 285 ms returned sat
[2024-05-21 01:00:30] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-21 01:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:00:32] [INFO ] [Nat]Absence check using state equation in 2282 ms returned sat
[2024-05-21 01:00:32] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 01:00:35] [INFO ] Added : 256 causal constraints over 52 iterations in 2741 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 119 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 361 reset in 3927 ms.
Product exploration explored 100000 steps with 365 reset in 4196 ms.
Built C files in :
/tmp/ltsmin2009295167897581486
[2024-05-21 01:00:43] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-21 01:00:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:00:43] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-21 01:00:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:00:43] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2024-05-21 01:00:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:00:43] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2009295167897581486
Running compilation step : cd /tmp/ltsmin2009295167897581486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1256 ms.
Running link step : cd /tmp/ltsmin2009295167897581486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2009295167897581486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1621112838320351852.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1028 transition count 513
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1027 transition count 513
Applied a total of 2 rules in 34 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-05-21 01:00:58] [INFO ] Computed 515 invariants in 11 ms
[2024-05-21 01:00:59] [INFO ] Implicit Places using invariants in 743 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 745 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1028 places, 513/514 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 SI_LTL mode , in 2 iterations and 805 ms. Remains : 1026/1028 places, 513/514 transitions.
Built C files in :
/tmp/ltsmin16493661789016247803
[2024-05-21 01:00:59] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 01:00:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:00:59] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 01:00:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:00:59] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 01:00:59] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:00:59] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16493661789016247803
Running compilation step : cd /tmp/ltsmin16493661789016247803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1246 ms.
Running link step : cd /tmp/ltsmin16493661789016247803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16493661789016247803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased952898546894139273.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:01:14] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:01:14] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:01:14] [INFO ] Time to serialize gal into /tmp/LTL15445744792391669589.gal : 4 ms
[2024-05-21 01:01:14] [INFO ] Time to serialize properties into /tmp/LTL9267916313373950080.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15445744792391669589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6965551269788677652.hoa' '-atoms' '/tmp/LTL9267916313373950080.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9267916313373950080.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6965551269788677652.hoa
Detected timeout of ITS tools.
[2024-05-21 01:01:29] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:01:29] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:01:29] [INFO ] Time to serialize gal into /tmp/LTL17758961293345226931.gal : 3 ms
[2024-05-21 01:01:29] [INFO ] Time to serialize properties into /tmp/LTL16757462162276685748.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17758961293345226931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16757462162276685748.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(((F("((F446<1)||(Section_445<1))"))&&(X(F(("((F477>=1)&&(Section_476>=1))")||(G("((F446>=1)&&(Section_445>=1))"))))))&&("((F2<1)|...175
Formula 0 simplified : G(!"((F2<1)||(Section_1<1))" | G!"((F446<1)||(Section_445<1))" | XG(!"((F477>=1)&&(Section_476>=1))" & F!"((F446>=1)&&(Section_445>=...161
Detected timeout of ITS tools.
[2024-05-21 01:01:44] [INFO ] Flatten gal took : 20 ms
[2024-05-21 01:01:44] [INFO ] Applying decomposition
[2024-05-21 01:01:44] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15652369596833009844.txt' '-o' '/tmp/graph15652369596833009844.bin' '-w' '/tmp/graph15652369596833009844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15652369596833009844.bin' '-l' '-1' '-v' '-w' '/tmp/graph15652369596833009844.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:01:44] [INFO ] Decomposing Gal with order
[2024-05-21 01:01:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:01:44] [INFO ] Flatten gal took : 26 ms
[2024-05-21 01:01:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:01:44] [INFO ] Time to serialize gal into /tmp/LTL4664495964744318130.gal : 6 ms
[2024-05-21 01:01:44] [INFO ] Time to serialize properties into /tmp/LTL748201971338981156.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4664495964744318130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL748201971338981156.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(((F("((i25.u244.F446<1)||(i25.u244.Section_445<1))"))&&(X(F(("((i6.u94.F477>=1)&&(i6.u402.Section_476>=1))")||(G("((i25.u244.F446...244
Formula 0 simplified : G(!"((i18.u472.F2<1)||(i18.u472.Section_1<1))" | G!"((i25.u244.F446<1)||(i25.u244.Section_445<1))" | XG(!"((i6.u94.F477>=1)&&(i6.u40...230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18368871585273617207
[2024-05-21 01:01:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18368871585273617207
Running compilation step : cd /tmp/ltsmin18368871585273617207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 944 ms.
Running link step : cd /tmp/ltsmin18368871585273617207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18368871585273617207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&X(<>(((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(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 139591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1||F(p2))))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 42 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 01:02:15] [INFO ] Computed 520 invariants in 16 ms
[2024-05-21 01:02:15] [INFO ] Implicit Places using invariants in 810 ms returned [285, 304, 743, 794, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 811 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1287 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 891 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (LT s186 1) (LT s964 1)), p1:(AND (GEQ s182 1) (GEQ s1158 1)), p0:(OR (LT s92 1) (LT s103 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21354 reset in 4439 ms.
Product exploration explored 100000 steps with 20144 reset in 4622 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 50 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 406 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
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
[2024-05-21 01:02:27] [INFO ] Computed 515 invariants in 16 ms
[2024-05-21 01:02:28] [INFO ] Implicit Places using invariants in 781 ms returned []
[2024-05-21 01:02:28] [INFO ] Invariant cache hit.
[2024-05-21 01:02:29] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2024-05-21 01:02:29] [INFO ] Invariant cache hit.
[2024-05-21 01:02:29] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. 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 p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 255 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 2821 steps, including 0 resets, run visited all 7 properties in 116 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 440 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 21565 reset in 4495 ms.
Product exploration explored 100000 steps with 21548 reset in 4717 ms.
Applying partial POR strategy [true, true, false, false, true, true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 1282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1282 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 250 place count 1282 transition count 768
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 252 place count 1282 transition count 768
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 1282 transition count 768
Deduced a syphon composed of 254 places in 0 ms
Applied a total of 254 rules in 100 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 01:02:41] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 01:02:41] [INFO ] Computed 515 invariants in 9 ms
[2024-05-21 01:02:42] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1282/1282 places, 768/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 1282/1282 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin7003330628552465288
[2024-05-21 01:02:42] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7003330628552465288
Running compilation step : cd /tmp/ltsmin7003330628552465288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1535 ms.
Running link step : cd /tmp/ltsmin7003330628552465288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7003330628552465288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16933859665516574854.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 40 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 01:02:57] [INFO ] Computed 515 invariants in 17 ms
[2024-05-21 01:02:58] [INFO ] Implicit Places using invariants in 790 ms returned []
[2024-05-21 01:02:58] [INFO ] Invariant cache hit.
[2024-05-21 01:02:59] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2024-05-21 01:02:59] [INFO ] Invariant cache hit.
[2024-05-21 01:02:59] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2596 ms. Remains : 1282/1282 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin10114516426731010311
[2024-05-21 01:02:59] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10114516426731010311
Running compilation step : cd /tmp/ltsmin10114516426731010311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1517 ms.
Running link step : cd /tmp/ltsmin10114516426731010311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10114516426731010311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5602591651224291657.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:03:15] [INFO ] Flatten gal took : 21 ms
[2024-05-21 01:03:15] [INFO ] Flatten gal took : 20 ms
[2024-05-21 01:03:15] [INFO ] Time to serialize gal into /tmp/LTL7527603289853470376.gal : 3 ms
[2024-05-21 01:03:15] [INFO ] Time to serialize properties into /tmp/LTL16147900727339927860.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7527603289853470376.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14209259142519333674.hoa' '-atoms' '/tmp/LTL16147900727339927860.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16147900727339927860.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14209259142519333674.hoa
Detected timeout of ITS tools.
[2024-05-21 01:03:30] [INFO ] Flatten gal took : 19 ms
[2024-05-21 01:03:30] [INFO ] Flatten gal took : 20 ms
[2024-05-21 01:03:30] [INFO ] Time to serialize gal into /tmp/LTL14366710372737198186.gal : 3 ms
[2024-05-21 01:03:30] [INFO ] Time to serialize properties into /tmp/LTL2877594950699083757.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14366710372737198186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2877594950699083757.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((F86<1)||(Section_85<1))"))||(X(("((Section_131>=1)&&(F132>=1))")||(F("((Section_547<1)||(F548<1))")))))))
Formula 0 simplified : X(F!"((F86<1)||(Section_85<1))" & X(!"((Section_131>=1)&&(F132>=1))" & G!"((Section_547<1)||(F548<1))"))
Detected timeout of ITS tools.
[2024-05-21 01:03:45] [INFO ] Flatten gal took : 27 ms
[2024-05-21 01:03:45] [INFO ] Applying decomposition
[2024-05-21 01:03:45] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8868805335311910543.txt' '-o' '/tmp/graph8868805335311910543.bin' '-w' '/tmp/graph8868805335311910543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8868805335311910543.bin' '-l' '-1' '-v' '-w' '/tmp/graph8868805335311910543.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:03:45] [INFO ] Decomposing Gal with order
[2024-05-21 01:03:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:03:45] [INFO ] Flatten gal took : 25 ms
[2024-05-21 01:03:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:03:45] [INFO ] Time to serialize gal into /tmp/LTL4292038771529759716.gal : 6 ms
[2024-05-21 01:03:45] [INFO ] Time to serialize properties into /tmp/LTL2534040157146070858.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4292038771529759716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2534040157146070858.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G("((i21.u22.F86<1)||(i21.u27.Section_85<1))"))||(X(("((i36.u51.Section_131>=1)&&(i37.u175.F132>=1))")||(F("((i5.u53.Section_547...185
Formula 0 simplified : X(F!"((i21.u22.F86<1)||(i21.u27.Section_85<1))" & X(!"((i36.u51.Section_131>=1)&&(i37.u175.F132>=1))" & G!"((i5.u53.Section_547<1)||...175
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4723510130407163740
[2024-05-21 01:04:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4723510130407163740
Running compilation step : cd /tmp/ltsmin4723510130407163740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1393 ms.
Running link step : cd /tmp/ltsmin4723510130407163740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4723510130407163740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(((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-13 finished in 120452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 242 rules applied. Total rules applied 481 place count 1048 transition count 526
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 68 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 01:04:15] [INFO ] Computed 520 invariants in 11 ms
[2024-05-21 01:04:16] [INFO ] Implicit Places using invariants in 701 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 702 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 797 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (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=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s60 1) (GEQ s256 1)), p1:(AND (GEQ s475 1) (GEQ s715 1)), p2:(AND (GEQ s142 1) (GEQ s952 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7 reset in 3096 ms.
Product exploration explored 100000 steps with 3 reset in 3402 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 385 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Finished random walk after 171 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 422 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 6 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 30 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 01:04:24] [INFO ] Computed 513 invariants in 12 ms
[2024-05-21 01:04:25] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-21 01:04:25] [INFO ] Invariant cache hit.
[2024-05-21 01:04:26] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2024-05-21 01:04:26] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 01:04:26] [INFO ] Invariant cache hit.
[2024-05-21 01:04:26] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2124 ms. 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 p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 357 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Finished random walk after 240 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 420 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 3 reset in 3060 ms.
Product exploration explored 100000 steps with 0 reset in 3366 ms.
Built C files in :
/tmp/ltsmin13389418112912574362
[2024-05-21 01:04:35] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 01:04:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:04:35] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 01:04:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:04:35] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 01:04:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:04:35] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13389418112912574362
Running compilation step : cd /tmp/ltsmin13389418112912574362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1307 ms.
Running link step : cd /tmp/ltsmin13389418112912574362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13389418112912574362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7424131430512033848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 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 33 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 01:04:50] [INFO ] Invariant cache hit.
[2024-05-21 01:04:51] [INFO ] Implicit Places using invariants in 715 ms returned []
[2024-05-21 01:04:51] [INFO ] Invariant cache hit.
[2024-05-21 01:04:52] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1693 ms to find 0 implicit places.
[2024-05-21 01:04:52] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 01:04:52] [INFO ] Invariant cache hit.
[2024-05-21 01:04:52] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2135 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin16557500165040047345
[2024-05-21 01:04:52] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 01:04:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:04:52] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 01:04:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:04:52] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 01:04:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:04:52] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16557500165040047345
Running compilation step : cd /tmp/ltsmin16557500165040047345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1274 ms.
Running link step : cd /tmp/ltsmin16557500165040047345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16557500165040047345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2935985007090890940.hoa' '--buchi-type=spotba'
LTSmin run took 13455 ms.
FORMULA CircularTrains-PT-768-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-14 finished in 51856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))||G((p0||(F(p2)&&p1)))))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 01:05:07] [INFO ] Computed 520 invariants in 15 ms
[2024-05-21 01:05:08] [INFO ] Implicit Places using invariants in 800 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 802 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 880 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s381 1)), p1:(AND (GEQ s19 1) (GEQ s381 1)), p2:(AND (GEQ s792 1) (GEQ s1263 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 196 reset in 3635 ms.
Product exploration explored 100000 steps with 185 reset in 3822 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) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 108 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 01:05:17] [INFO ] Computed 513 invariants in 12 ms
[2024-05-21 01:05:17] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 p2)), (F p0), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 299 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
[2024-05-21 01:05:18] [INFO ] Invariant cache hit.
[2024-05-21 01:05:19] [INFO ] [Real]Absence check using 511 positive place invariants in 323 ms returned sat
[2024-05-21 01:05:19] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 50 ms returned sat
[2024-05-21 01:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:05:28] [INFO ] [Real]Absence check using state equation in 9258 ms returned sat
[2024-05-21 01:05:28] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-21 01:05:33] [INFO ] Added : 70 causal constraints over 14 iterations in 4695 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1280 transition count 516
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 504 place count 1028 transition count 516
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 504 place count 1028 transition count 512
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 512 place count 1024 transition count 512
Applied a total of 512 rules in 39 ms. Remains 1024 /1280 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 01:05:33] [INFO ] Computed 513 invariants in 13 ms
[2024-05-21 01:05:34] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-21 01:05:34] [INFO ] Invariant cache hit.
[2024-05-21 01:05:35] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-21 01:05:35] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 01:05:35] [INFO ] Invariant cache hit.
[2024-05-21 01:05:35] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1280 places, 512/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2089 ms. Remains : 1024/1280 places, 512/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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Finished random walk after 374 steps, including 0 resets, run visited all 3 properties in 24 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p0)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
[2024-05-21 01:05:37] [INFO ] Invariant cache hit.
[2024-05-21 01:05:37] [INFO ] [Real]Absence check using 511 positive place invariants in 284 ms returned sat
[2024-05-21 01:05:37] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-21 01:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:05:42] [INFO ] [Real]Absence check using state equation in 4584 ms returned sat
[2024-05-21 01:05:42] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 01:05:52] [INFO ] Deduced a trap composed of 2 places in 481 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 01:05:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Product exploration explored 100000 steps with 383 reset in 3962 ms.
Product exploration explored 100000 steps with 369 reset in 4220 ms.
Built C files in :
/tmp/ltsmin7876562098742360427
[2024-05-21 01:06:00] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 01:06:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:06:00] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 01:06:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:06:00] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 01:06:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:06:00] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7876562098742360427
Running compilation step : cd /tmp/ltsmin7876562098742360427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1315 ms.
Running link step : cd /tmp/ltsmin7876562098742360427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7876562098742360427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11348691466684400882.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 31 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 01:06:16] [INFO ] Invariant cache hit.
[2024-05-21 01:06:16] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-05-21 01:06:16] [INFO ] Invariant cache hit.
[2024-05-21 01:06:17] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
[2024-05-21 01:06:17] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 01:06:17] [INFO ] Invariant cache hit.
[2024-05-21 01:06:18] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2082 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin4128706927169110678
[2024-05-21 01:06:18] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 01:06:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:06:18] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 01:06:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:06:18] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 01:06:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:06:18] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4128706927169110678
Running compilation step : cd /tmp/ltsmin4128706927169110678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1224 ms.
Running link step : cd /tmp/ltsmin4128706927169110678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4128706927169110678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5548315048601676930.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:06:33] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:06:33] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:06:33] [INFO ] Time to serialize gal into /tmp/LTL15579599259413372003.gal : 3 ms
[2024-05-21 01:06:33] [INFO ] Time to serialize properties into /tmp/LTL6410763453266029299.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15579599259413372003.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6199904432754292707.hoa' '-atoms' '/tmp/LTL6410763453266029299.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6410763453266029299.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6199904432754292707.hoa
Detected timeout of ITS tools.
[2024-05-21 01:06:48] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:06:48] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:06:48] [INFO ] Time to serialize gal into /tmp/LTL2846960445093782239.gal : 3 ms
[2024-05-21 01:06:48] [INFO ] Time to serialize properties into /tmp/LTL11635789957472237790.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2846960445093782239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11635789957472237790.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((F159>=1)&&(Section_158>=1))")))||(G(("((F159>=1)&&(Section_158>=1))")||(("((F159>=1)&&(Section_158>=1))")&&(F("((F750>=...186
Formula 0 simplified : FG!"((F159>=1)&&(Section_158>=1))"
Detected timeout of ITS tools.
[2024-05-21 01:07:03] [INFO ] Flatten gal took : 21 ms
[2024-05-21 01:07:03] [INFO ] Applying decomposition
[2024-05-21 01:07:03] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph893381855972215954.txt' '-o' '/tmp/graph893381855972215954.bin' '-w' '/tmp/graph893381855972215954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph893381855972215954.bin' '-l' '-1' '-v' '-w' '/tmp/graph893381855972215954.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:07:03] [INFO ] Decomposing Gal with order
[2024-05-21 01:07:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:07:03] [INFO ] Flatten gal took : 45 ms
[2024-05-21 01:07:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 01:07:03] [INFO ] Time to serialize gal into /tmp/LTL12587711912523675267.gal : 7 ms
[2024-05-21 01:07:03] [INFO ] Time to serialize properties into /tmp/LTL5410743761654927471.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12587711912523675267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5410743761654927471.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((i27.u10.F159>=1)&&(i27.u155.Section_158>=1))")))||(G(("((i27.u10.F159>=1)&&(i27.u155.Section_158>=1))")||(("((i27.u10.F...253
Formula 0 simplified : FG!"((i27.u10.F159>=1)&&(i27.u155.Section_158>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin554708215214318338
[2024-05-21 01:07:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin554708215214318338
Running compilation step : cd /tmp/ltsmin554708215214318338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 945 ms.
Running link step : cd /tmp/ltsmin554708215214318338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin554708215214318338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp0==true)))||[](((LTLAPp0==true)||(<>((LTLAPp2==true))&&(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 146342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||F(p1)))'
Found a Lengthening insensitive property : CircularTrains-PT-768-LTLFireability-03
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1048 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 480 place count 1047 transition count 520
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 89 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-21 01:07:34] [INFO ] Computed 520 invariants in 9 ms
[2024-05-21 01:07:34] [INFO ] Implicit Places using invariants in 692 ms returned [76, 227, 242, 636, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 693 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 24 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 808 ms. Remains : 1026/1287 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(OR (LT s668 1) (LT s903 1)), p0:(AND (GEQ s384 1) (GEQ s591 1) (GEQ s26 1) (GEQ s811 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 522 reset in 4016 ms.
Product exploration explored 100000 steps with 546 reset in 4335 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 703 steps, including 0 resets, run visited all 3 properties in 32 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 513 rows 1026 cols
[2024-05-21 01:07:44] [INFO ] Computed 514 invariants in 10 ms
[2024-05-21 01:07:45] [INFO ] [Real]Absence check using 510 positive place invariants in 279 ms returned sat
[2024-05-21 01:07:45] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 71 ms returned sat
[2024-05-21 01:07:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:07:49] [INFO ] [Real]Absence check using state equation in 4278 ms returned sat
[2024-05-21 01:07:49] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-21 01:07:59] [INFO ] Added : 240 causal constraints over 48 iterations in 9909 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
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 20 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 01:07:59] [INFO ] Invariant cache hit.
[2024-05-21 01:08:00] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-21 01:08:00] [INFO ] Invariant cache hit.
[2024-05-21 01:08:01] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2024-05-21 01:08:01] [INFO ] Invariant cache hit.
[2024-05-21 01:08:01] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2020 ms. 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 p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 392 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 243 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-21 01:08:03] [INFO ] Invariant cache hit.
[2024-05-21 01:08:03] [INFO ] [Real]Absence check using 510 positive place invariants in 283 ms returned sat
[2024-05-21 01:08:03] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 80 ms returned sat
[2024-05-21 01:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:08:07] [INFO ] [Real]Absence check using state equation in 3436 ms returned sat
[2024-05-21 01:08:07] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 01:08:10] [INFO ] Added : 255 causal constraints over 51 iterations in 3522 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 508 reset in 3992 ms.
Product exploration explored 100000 steps with 526 reset in 4260 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (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 30 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 01:08:19] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 01:08:19] [INFO ] Invariant cache hit.
[2024-05-21 01:08:20] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin14275728341111401430
[2024-05-21 01:08:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14275728341111401430
Running compilation step : cd /tmp/ltsmin14275728341111401430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 941 ms.
Running link step : cd /tmp/ltsmin14275728341111401430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14275728341111401430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13612560135141512932.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 21 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 01:08:35] [INFO ] Invariant cache hit.
[2024-05-21 01:08:35] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-21 01:08:35] [INFO ] Invariant cache hit.
[2024-05-21 01:08:36] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2024-05-21 01:08:36] [INFO ] Invariant cache hit.
[2024-05-21 01:08:37] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2098 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin17766148210822194116
[2024-05-21 01:08:37] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17766148210822194116
Running compilation step : cd /tmp/ltsmin17766148210822194116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1049 ms.
Running link step : cd /tmp/ltsmin17766148210822194116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17766148210822194116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11555266156187489449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:08:52] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:08:52] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:08:52] [INFO ] Time to serialize gal into /tmp/LTL5409680092957184821.gal : 3 ms
[2024-05-21 01:08:52] [INFO ] Time to serialize properties into /tmp/LTL11464239089521048146.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5409680092957184821.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11840171620778459356.hoa' '-atoms' '/tmp/LTL11464239089521048146.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11464239089521048146.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11840171620778459356.hoa
Detected timeout of ITS tools.
[2024-05-21 01:09:07] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:09:07] [INFO ] Flatten gal took : 19 ms
[2024-05-21 01:09:07] [INFO ] Time to serialize gal into /tmp/LTL8506208834515636816.gal : 3 ms
[2024-05-21 01:09:07] [INFO ] Time to serialize properties into /tmp/LTL7700477808144769346.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8506208834515636816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7700477808144769346.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))")))))||(F("((Section_666<1)||(F667<1))"))))
Formula 0 simplified : XXXF!"(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))" & G!"((Section_666<1)||(F667<1))"
Detected timeout of ITS tools.
[2024-05-21 01:09:22] [INFO ] Flatten gal took : 18 ms
[2024-05-21 01:09:22] [INFO ] Applying decomposition
[2024-05-21 01:09:22] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14117951675355472179.txt' '-o' '/tmp/graph14117951675355472179.bin' '-w' '/tmp/graph14117951675355472179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14117951675355472179.bin' '-l' '-1' '-v' '-w' '/tmp/graph14117951675355472179.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:09:22] [INFO ] Decomposing Gal with order
[2024-05-21 01:09:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:09:22] [INFO ] Flatten gal took : 23 ms
[2024-05-21 01:09:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 01:09:22] [INFO ] Time to serialize gal into /tmp/LTL10355118346110266173.gal : 6 ms
[2024-05-21 01:09:22] [INFO ] Time to serialize properties into /tmp/LTL17637073121509127478.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10355118346110266173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17637073121509127478.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((i7.u34.Section_277>=1)&&(i7.u34.F278>=1))&&((i29.i0.i0.i0.u14.F573>=1)&&(i29.i0.i0.i0.u412.Section_572>=1)))")))))||(F...225
Formula 0 simplified : XXXF!"(((i7.u34.Section_277>=1)&&(i7.u34.F278>=1))&&((i29.i0.i0.i0.u14.F573>=1)&&(i29.i0.i0.i0.u412.Section_572>=1)))" & G!"((i10.i0...211
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5090108633982530456
[2024-05-21 01:09:37] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5090108633982530456
Running compilation step : cd /tmp/ltsmin5090108633982530456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 942 ms.
Running link step : cd /tmp/ltsmin5090108633982530456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5090108633982530456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(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-03 finished in 139202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-07
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1287 transition count 527
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 1046 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 73 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 01:09:53] [INFO ] Computed 520 invariants in 11 ms
[2024-05-21 01:09:53] [INFO ] Implicit Places using invariants in 688 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 689 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 790 ms. Remains : 1024/1287 places, 512/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s583 1) (GEQ s830 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 25316 reset in 3646 ms.
Product exploration explored 100000 steps with 25690 reset in 3920 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 572 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
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 164 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 20 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 01:10:02] [INFO ] Computed 513 invariants in 14 ms
[2024-05-21 01:10:03] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-21 01:10:03] [INFO ] Invariant cache hit.
[2024-05-21 01:10:04] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
[2024-05-21 01:10:04] [INFO ] Invariant cache hit.
[2024-05-21 01:10:04] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1985 ms. 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
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 173 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26566 reset in 3696 ms.
Product exploration explored 100000 steps with 26103 reset in 3905 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (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.
[2024-05-21 01:10:13] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 01:10:13] [INFO ] Invariant cache hit.
[2024-05-21 01:10:13] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin12979645422659610700
[2024-05-21 01:10:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12979645422659610700
Running compilation step : cd /tmp/ltsmin12979645422659610700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 934 ms.
Running link step : cd /tmp/ltsmin12979645422659610700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12979645422659610700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7342195669037375861.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 28 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 01:10:28] [INFO ] Invariant cache hit.
[2024-05-21 01:10:29] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-21 01:10:29] [INFO ] Invariant cache hit.
[2024-05-21 01:10:30] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2024-05-21 01:10:30] [INFO ] Invariant cache hit.
[2024-05-21 01:10:30] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2035 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin8025085348731514216
[2024-05-21 01:10:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8025085348731514216
Running compilation step : cd /tmp/ltsmin8025085348731514216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 926 ms.
Running link step : cd /tmp/ltsmin8025085348731514216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8025085348731514216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3503893614672299234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:10:46] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:10:46] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:10:46] [INFO ] Time to serialize gal into /tmp/LTL14846580161516792396.gal : 3 ms
[2024-05-21 01:10:46] [INFO ] Time to serialize properties into /tmp/LTL16544387907004185436.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14846580161516792396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7838994567207622252.hoa' '-atoms' '/tmp/LTL16544387907004185436.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16544387907004185436.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7838994567207622252.hoa
Detected timeout of ITS tools.
[2024-05-21 01:11:01] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:11:01] [INFO ] Flatten gal took : 18 ms
[2024-05-21 01:11:01] [INFO ] Time to serialize gal into /tmp/LTL13718862407099440257.gal : 3 ms
[2024-05-21 01:11:01] [INFO ] Time to serialize properties into /tmp/LTL7264337539880109336.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13718862407099440257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7264337539880109336.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((Section_675>=1)&&(F676>=1))"))))
Formula 0 simplified : XG!"((Section_675>=1)&&(F676>=1))"
Detected timeout of ITS tools.
[2024-05-21 01:11:16] [INFO ] Flatten gal took : 18 ms
[2024-05-21 01:11:16] [INFO ] Applying decomposition
[2024-05-21 01:11:16] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13059269336130156394.txt' '-o' '/tmp/graph13059269336130156394.bin' '-w' '/tmp/graph13059269336130156394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13059269336130156394.bin' '-l' '-1' '-v' '-w' '/tmp/graph13059269336130156394.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:11:16] [INFO ] Decomposing Gal with order
[2024-05-21 01:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:11:16] [INFO ] Flatten gal took : 21 ms
[2024-05-21 01:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 01:11:16] [INFO ] Time to serialize gal into /tmp/LTL9394468721112621834.gal : 15 ms
[2024-05-21 01:11:16] [INFO ] Time to serialize properties into /tmp/LTL7092332447585061510.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9394468721112621834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7092332447585061510.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("((i13.i0.i0.i1.u307.Section_675>=1)&&(i13.i0.i1.i0.u139.F676>=1))"))))
Formula 0 simplified : XG!"((i13.i0.i0.i1.u307.Section_675>=1)&&(i13.i0.i1.i0.u139.F676>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2338095251501334102
[2024-05-21 01:11:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2338095251501334102
Running compilation step : cd /tmp/ltsmin2338095251501334102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 925 ms.
Running link step : cd /tmp/ltsmin2338095251501334102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2338095251501334102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 113725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(F((p2||G(!p1)))))))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-12
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 480 place count 1047 transition count 521
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 494 place count 1040 transition count 521
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 508 place count 1033 transition count 514
Applied a total of 508 rules in 73 ms. Remains 1033 /1287 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1033 cols
[2024-05-21 01:11:46] [INFO ] Computed 520 invariants in 14 ms
[2024-05-21 01:11:47] [INFO ] Implicit Places using invariants in 678 ms returned [76, 594, 636, 775, 947]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 680 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1028/1287 places, 514/768 transitions.
Applied a total of 0 rules in 24 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 777 ms. Remains : 1028/1287 places, 514/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s226 1) (LT s952 1)), p1:(OR (LT s241 1) (LT s502 1)), p2:(AND (GEQ s214 1) (GEQ s810 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 351 reset in 3880 ms.
Product exploration explored 100000 steps with 360 reset in 4189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 550 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Finished random walk after 138 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 633 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
// Phase 1: matrix 514 rows 1028 cols
[2024-05-21 01:11:57] [INFO ] Computed 515 invariants in 10 ms
[2024-05-21 01:11:58] [INFO ] [Real]Absence check using 511 positive place invariants in 282 ms returned sat
[2024-05-21 01:11:58] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 59 ms returned sat
[2024-05-21 01:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:12:01] [INFO ] [Real]Absence check using state equation in 2872 ms returned sat
[2024-05-21 01:12:01] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 01:12:04] [INFO ] Added : 256 causal constraints over 52 iterations in 3156 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 4 out of 1028 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_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.
[2024-05-21 01:12:04] [INFO ] Invariant cache hit.
[2024-05-21 01:12:05] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-21 01:12:05] [INFO ] Invariant cache hit.
[2024-05-21 01:12:06] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2024-05-21 01:12:06] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 01:12:06] [INFO ] Invariant cache hit.
[2024-05-21 01:12:06] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2028 ms. 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 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Finished random walk after 407 steps, including 0 resets, run visited all 4 properties in 23 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 4 factoid took 358 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 125 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-05-21 01:12:08] [INFO ] Invariant cache hit.
[2024-05-21 01:12:09] [INFO ] [Real]Absence check using 511 positive place invariants in 289 ms returned sat
[2024-05-21 01:12:09] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 95 ms returned sat
[2024-05-21 01:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:12:11] [INFO ] [Real]Absence check using state equation in 2025 ms returned sat
[2024-05-21 01:12:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:12:11] [INFO ] [Nat]Absence check using 511 positive place invariants in 288 ms returned sat
[2024-05-21 01:12:11] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 64 ms returned sat
[2024-05-21 01:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:12:13] [INFO ] [Nat]Absence check using state equation in 1890 ms returned sat
[2024-05-21 01:12:13] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-21 01:12:16] [INFO ] Added : 256 causal constraints over 52 iterations in 2840 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 129 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 382 reset in 3948 ms.
Product exploration explored 100000 steps with 377 reset in 4196 ms.
Built C files in :
/tmp/ltsmin15849837249670121372
[2024-05-21 01:12:24] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-21 01:12:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:12:24] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-21 01:12:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:12:24] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2024-05-21 01:12:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:12:25] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15849837249670121372
Running compilation step : cd /tmp/ltsmin15849837249670121372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1244 ms.
Running link step : cd /tmp/ltsmin15849837249670121372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15849837249670121372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3825035537614819944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1028 transition count 513
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1027 transition count 513
Applied a total of 2 rules in 32 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-05-21 01:12:40] [INFO ] Computed 515 invariants in 11 ms
[2024-05-21 01:12:40] [INFO ] Implicit Places using invariants in 656 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 657 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1028 places, 513/514 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 SI_LTL mode , in 2 iterations and 715 ms. Remains : 1026/1028 places, 513/514 transitions.
Built C files in :
/tmp/ltsmin5196541770910117165
[2024-05-21 01:12:40] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 01:12:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:12:40] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 01:12:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:12:40] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 01:12:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:12:40] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5196541770910117165
Running compilation step : cd /tmp/ltsmin5196541770910117165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1235 ms.
Running link step : cd /tmp/ltsmin5196541770910117165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5196541770910117165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17556606019364008743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:12:55] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:12:55] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:12:55] [INFO ] Time to serialize gal into /tmp/LTL14127363149085284286.gal : 3 ms
[2024-05-21 01:12:55] [INFO ] Time to serialize properties into /tmp/LTL7278356548769510470.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14127363149085284286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut649073071233955891.hoa' '-atoms' '/tmp/LTL7278356548769510470.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7278356548769510470.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut649073071233955891.hoa
Detected timeout of ITS tools.
[2024-05-21 01:13:10] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:13:10] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:13:10] [INFO ] Time to serialize gal into /tmp/LTL12049338628297907988.gal : 3 ms
[2024-05-21 01:13:10] [INFO ] Time to serialize properties into /tmp/LTL10667142213749357072.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12049338628297907988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10667142213749357072.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(((F("((F446<1)||(Section_445<1))"))&&(X(F(("((F477>=1)&&(Section_476>=1))")||(G("((F446>=1)&&(Section_445>=1))"))))))&&("((F2<1)|...175
Formula 0 simplified : G(!"((F2<1)||(Section_1<1))" | G!"((F446<1)||(Section_445<1))" | XG(!"((F477>=1)&&(Section_476>=1))" & F!"((F446>=1)&&(Section_445>=...161
Detected timeout of ITS tools.
[2024-05-21 01:13:25] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:13:25] [INFO ] Applying decomposition
[2024-05-21 01:13:25] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14482092574720346483.txt' '-o' '/tmp/graph14482092574720346483.bin' '-w' '/tmp/graph14482092574720346483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14482092574720346483.bin' '-l' '-1' '-v' '-w' '/tmp/graph14482092574720346483.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:13:25] [INFO ] Decomposing Gal with order
[2024-05-21 01:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:13:26] [INFO ] Flatten gal took : 21 ms
[2024-05-21 01:13:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 01:13:26] [INFO ] Time to serialize gal into /tmp/LTL6270890471529738338.gal : 7 ms
[2024-05-21 01:13:26] [INFO ] Time to serialize properties into /tmp/LTL11339151378193304865.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6270890471529738338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11339151378193304865.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((F("((i4.u255.F446<1)||(i4.u255.Section_445<1))"))&&(X(F(("((i27.i0.i0.i0.u47.F477>=1)&&(i27.i0.i0.i0.u399.Section_476>=1))")||(...260
Formula 0 simplified : G(!"((i18.u472.F2<1)||(i18.u472.Section_1<1))" | G!"((i4.u255.F446<1)||(i4.u255.Section_445<1))" | XG(!"((i27.i0.i0.i0.u47.F477>=1)&...246
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9850721415989262144
[2024-05-21 01:13:41] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9850721415989262144
Running compilation step : cd /tmp/ltsmin9850721415989262144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 937 ms.
Running link step : cd /tmp/ltsmin9850721415989262144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9850721415989262144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&X(<>(((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(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 129584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))||G((p0||(F(p2)&&p1)))))))'
Found a Lengthening insensitive property : CircularTrains-PT-768-LTLFireability-15
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1287 transition count 530
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 1049 transition count 530
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 476 place count 1049 transition count 519
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 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 59 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 01:13:56] [INFO ] Computed 520 invariants in 13 ms
[2024-05-21 01:13:57] [INFO ] Implicit Places using invariants in 674 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 676 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 763 ms. Remains : 1024/1287 places, 512/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s305 1)), p1:(AND (GEQ s16 1) (GEQ s305 1)), p2:(AND (GEQ s632 1) (GEQ s1011 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 342 reset in 3818 ms.
Product exploration explored 100000 steps with 374 reset in 4162 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) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 01:14:07] [INFO ] Computed 513 invariants in 13 ms
[2024-05-21 01:14:07] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 p2)), (F p0), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 421 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
[2024-05-21 01:14:07] [INFO ] Invariant cache hit.
[2024-05-21 01:14:08] [INFO ] [Real]Absence check using 511 positive place invariants in 290 ms returned sat
[2024-05-21 01:14:08] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-21 01:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:14:13] [INFO ] [Real]Absence check using state equation in 4526 ms returned sat
[2024-05-21 01:14:13] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-21 01:14:22] [INFO ] Added : 180 causal constraints over 36 iterations in 9633 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 29 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 01:14:22] [INFO ] Invariant cache hit.
[2024-05-21 01:14:23] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-05-21 01:14:23] [INFO ] Invariant cache hit.
[2024-05-21 01:14:24] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2024-05-21 01:14:24] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 01:14:24] [INFO ] Invariant cache hit.
[2024-05-21 01:14:24] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2025 ms. 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 p1))), (X (NOT p1)), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Finished random walk after 95 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p0)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 293 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
[2024-05-21 01:14:26] [INFO ] Invariant cache hit.
[2024-05-21 01:14:27] [INFO ] [Real]Absence check using 511 positive place invariants in 286 ms returned sat
[2024-05-21 01:14:27] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-21 01:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:14:31] [INFO ] [Real]Absence check using state equation in 4495 ms returned sat
[2024-05-21 01:14:31] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 01:14:41] [INFO ] Added : 185 causal constraints over 37 iterations in 9702 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false]
Product exploration explored 100000 steps with 363 reset in 3905 ms.
Product exploration explored 100000 steps with 354 reset in 4131 ms.
Built C files in :
/tmp/ltsmin9989612257569197388
[2024-05-21 01:14:49] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 01:14:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:14:49] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 01:14:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:14:49] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 01:14:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:14:49] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9989612257569197388
Running compilation step : cd /tmp/ltsmin9989612257569197388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1263 ms.
Running link step : cd /tmp/ltsmin9989612257569197388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9989612257569197388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14370966272075166035.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 01:15:04] [INFO ] Invariant cache hit.
[2024-05-21 01:15:05] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-21 01:15:05] [INFO ] Invariant cache hit.
[2024-05-21 01:15:06] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2024-05-21 01:15:06] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 01:15:06] [INFO ] Invariant cache hit.
[2024-05-21 01:15:06] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1996 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin15220842310770488666
[2024-05-21 01:15:06] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 01:15:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:15:06] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 01:15:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:15:06] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 01:15:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:15:06] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15220842310770488666
Running compilation step : cd /tmp/ltsmin15220842310770488666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1239 ms.
Running link step : cd /tmp/ltsmin15220842310770488666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15220842310770488666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17666530248017676855.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:15:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:15:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:15:21] [INFO ] Time to serialize gal into /tmp/LTL544903827087654415.gal : 2 ms
[2024-05-21 01:15:21] [INFO ] Time to serialize properties into /tmp/LTL15876282676499585907.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL544903827087654415.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17921143175592867646.hoa' '-atoms' '/tmp/LTL15876282676499585907.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15876282676499585907.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17921143175592867646.hoa
Detected timeout of ITS tools.
[2024-05-21 01:15:36] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:15:36] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:15:36] [INFO ] Time to serialize gal into /tmp/LTL3023126090383988303.gal : 2 ms
[2024-05-21 01:15:36] [INFO ] Time to serialize properties into /tmp/LTL385726999667260697.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3023126090383988303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL385726999667260697.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((F159>=1)&&(Section_158>=1))")))||(G(("((F159>=1)&&(Section_158>=1))")||(("((F159>=1)&&(Section_158>=1))")&&(F("((F750>=...186
Formula 0 simplified : FG!"((F159>=1)&&(Section_158>=1))"
Detected timeout of ITS tools.
[2024-05-21 01:15:51] [INFO ] Flatten gal took : 19 ms
[2024-05-21 01:15:51] [INFO ] Applying decomposition
[2024-05-21 01:15:51] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8610181569787751985.txt' '-o' '/tmp/graph8610181569787751985.bin' '-w' '/tmp/graph8610181569787751985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8610181569787751985.bin' '-l' '-1' '-v' '-w' '/tmp/graph8610181569787751985.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:15:51] [INFO ] Decomposing Gal with order
[2024-05-21 01:15:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:15:52] [INFO ] Flatten gal took : 20 ms
[2024-05-21 01:15:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:15:52] [INFO ] Time to serialize gal into /tmp/LTL5724633908898318007.gal : 5 ms
[2024-05-21 01:15:52] [INFO ] Time to serialize properties into /tmp/LTL14138180769488522806.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5724633908898318007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14138180769488522806.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((i13.u490.F159>=1)&&(i13.u385.Section_158>=1))")))||(G(("((i13.u490.F159>=1)&&(i13.u385.Section_158>=1))")||(("((i13.u49...275
Formula 0 simplified : FG!"((i13.u490.F159>=1)&&(i13.u385.Section_158>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14816249367064362128
[2024-05-21 01:16:07] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14816249367064362128
Running compilation step : cd /tmp/ltsmin14816249367064362128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 901 ms.
Running link step : cd /tmp/ltsmin14816249367064362128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14816249367064362128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp0==true)))||[](((LTLAPp0==true)||(<>((LTLAPp2==true))&&(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 145897 ms.
[2024-05-21 01:16:22] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5537584980650841780
[2024-05-21 01:16:22] [INFO ] Computing symmetric may disable matrix : 768 transitions.
[2024-05-21 01:16:22] [INFO ] Applying decomposition
[2024-05-21 01:16:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:16:22] [INFO ] Computing symmetric may enable matrix : 768 transitions.
[2024-05-21 01:16:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:16:22] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7718691362589046918.txt' '-o' '/tmp/graph7718691362589046918.bin' '-w' '/tmp/graph7718691362589046918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7718691362589046918.bin' '-l' '-1' '-v' '-w' '/tmp/graph7718691362589046918.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:16:22] [INFO ] Decomposing Gal with order
[2024-05-21 01:16:22] [INFO ] Computing Do-Not-Accords matrix : 768 transitions.
[2024-05-21 01:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:16:22] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:16:22] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5537584980650841780
Running compilation step : cd /tmp/ltsmin5537584980650841780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 01:16:22] [INFO ] Flatten gal took : 22 ms
[2024-05-21 01:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:16:22] [INFO ] Time to serialize gal into /tmp/LTLFireability9623133975512869784.gal : 5 ms
[2024-05-21 01:16:22] [INFO ] Time to serialize properties into /tmp/LTLFireability6384623105436169787.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9623133975512869784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6384623105436169787.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 5 LTL properties
Checking formula 0 : !(((X(X(X(G("(((i40.u127.Section_277>=1)&&(i40.u59.F278>=1))&&((i21.u188.F573>=1)&&(i21.u113.Section_572>=1)))")))))||(F("((i12.u227.S...193
Formula 0 simplified : XXXF!"(((i40.u127.Section_277>=1)&&(i40.u59.F278>=1))&&((i21.u188.F573>=1)&&(i21.u113.Section_572>=1)))" & G!"((i12.u227.Section_666...179
Compilation finished in 2142 ms.
Running link step : cd /tmp/ltsmin5537584980650841780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5537584980650841780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X([]((LTLAPp0==true)))))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: 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( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.035: LTL layer: formula: (X(X(X([]((LTLAPp0==true)))))||<>((LTLAPp1==true)))
pins2lts-mc-linux64( 4/ 8), 0.035: "(X(X(X([]((LTLAPp0==true)))))||<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.036: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.129: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.355: DFS-FIFO for weak LTL, using special progress label 781
pins2lts-mc-linux64( 0/ 8), 0.355: There are 782 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.355: State length is 1288, there are 774 groups
pins2lts-mc-linux64( 0/ 8), 0.355: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.355: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.355: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.355: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.822: ~1 levels ~960 states ~227256 transitions
pins2lts-mc-linux64( 6/ 8), 2.831: ~1 levels ~1920 states ~454520 transitions
pins2lts-mc-linux64( 6/ 8), 4.259: ~1 levels ~3840 states ~927528 transitions
pins2lts-mc-linux64( 6/ 8), 6.616: ~1 levels ~7680 states ~1892064 transitions
pins2lts-mc-linux64( 1/ 8), 10.923: ~1 levels ~15360 states ~3909536 transitions
pins2lts-mc-linux64( 7/ 8), 18.961: ~971 levels ~30720 states ~7262312 transitions
pins2lts-mc-linux64( 7/ 8), 31.028: ~4780 levels ~61440 states ~11812824 transitions
pins2lts-mc-linux64( 3/ 8), 37.173: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 39.840:
pins2lts-mc-linux64( 0/ 8), 39.840: mean standard work distribution: 6.4% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 39.840:
pins2lts-mc-linux64( 0/ 8), 39.840: Explored 61937 states 12959873 transitions, fanout: 209.243
pins2lts-mc-linux64( 0/ 8), 39.840: Total exploration time 39.460 sec (37.300 sec minimum, 38.179 sec on average)
pins2lts-mc-linux64( 0/ 8), 39.840: States per second: 1570, Transitions per second: 328431
pins2lts-mc-linux64( 0/ 8), 39.840:
pins2lts-mc-linux64( 0/ 8), 39.840: Progress states detected: 2860719
pins2lts-mc-linux64( 0/ 8), 39.840: Redundant explorations: -99.1629
pins2lts-mc-linux64( 0/ 8), 39.840:
pins2lts-mc-linux64( 0/ 8), 39.840: Queue width: 8B, total height: 5685646, memory: 43.38MB
pins2lts-mc-linux64( 0/ 8), 39.840: Tree memory: 312.4MB, 44.3 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 39.840: Tree fill ratio (roots/leafs): 5.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 39.840: Stored 775 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 39.840: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 39.840: Est. total memory use: 355.8MB (~1067.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5537584980650841780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X([]((LTLAPp0==true)))))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5537584980650841780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X([]((LTLAPp0==true)))))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 01:45:34] [INFO ] Flatten gal took : 134 ms
[2024-05-21 01:45:34] [INFO ] Time to serialize gal into /tmp/LTLFireability14208515176970819621.gal : 20 ms
[2024-05-21 01:45:34] [INFO ] Time to serialize properties into /tmp/LTLFireability1832842086621445936.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14208515176970819621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1832842086621445936.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 5 LTL properties
Checking formula 0 : !(((X(X(X(G("(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))")))))||(F("((Section_666<1)||(F667<1))"))))
Formula 0 simplified : XXXF!"(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))" & G!"((Section_666<1)||(F667<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13778224 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16141700 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r087-tall-171620521800233"
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 ;