About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8847.315 | 3600000.00 | 13311457.00 | 6972.70 | F?TFFTF?TT??TF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918100139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V80P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100139
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 7.2K Apr 29 21:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 21:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 21:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 21:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 45K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652570641205
Running Version 202205111006
[2022-05-14 23:24:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 23:24:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 23:24:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-14 23:24:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 23:24:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 582 ms
[2022-05-14 23:24:03] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-14 23:24:03] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 10 ms.
[2022-05-14 23:24:03] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 22) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 23:24:03] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-14 23:24:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 23:24:04] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-14 23:24:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 23:24:04] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 23:24:04] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-14 23:24:04] [INFO ] Flatten gal took : 18 ms
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 23:24:04] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-14 23:24:04] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 124 ms.
[2022-05-14 23:24:04] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 14 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 70 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:24:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:24:04] [INFO ] Computed 6 place invariants in 24 ms
[2022-05-14 23:24:05] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
[2022-05-14 23:24:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:24:05] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-14 23:24:05] [INFO ] Implicit Places using invariants in 307 ms returned []
[2022-05-14 23:24:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:24:05] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-14 23:24:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:24:06] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2022-05-14 23:24:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:24:06] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-14 23:24:07] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/188 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/188 places, 2108/2108 transitions.
Support contains 14 out of 187 places after structural reductions.
[2022-05-14 23:24:07] [INFO ] Flatten gal took : 158 ms
[2022-05-14 23:24:07] [INFO ] Flatten gal took : 153 ms
[2022-05-14 23:24:07] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 23:24:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:24:08] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-14 23:24:08] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-14 23:24:08] [INFO ] After 49ms 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.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 170 stabilizing places and 324 stable transitions
Graph (complete) has 4309 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&G(F(p1)))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Graph (complete) has 4309 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 304 ms. Remains 185 /187 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:24:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:08] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 23:24:09] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
[2022-05-14 23:24:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:09] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:24:09] [INFO ] Implicit Places using invariants in 341 ms returned []
[2022-05-14 23:24:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:09] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:24:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:24:10] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2022-05-14 23:24:11] [INFO ] Redundant transitions in 121 ms returned []
[2022-05-14 23:24:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:11] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 23:24:11] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/187 places, 2107/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/187 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s166 s82), p1:(LEQ s83 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 159 reset in 917 ms.
Product exploration explored 100000 steps with 160 reset in 798 ms.
Computed a total of 168 stabilizing places and 323 stable transitions
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 231 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 166 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:24:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:24:15] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
[2022-05-14 23:24:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:15] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:24:15] [INFO ] Implicit Places using invariants in 342 ms returned []
[2022-05-14 23:24:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:15] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:24:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:24:17] [INFO ] Implicit Places using invariants and state equation in 1804 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2022-05-14 23:24:17] [INFO ] Redundant transitions in 45 ms returned []
[2022-05-14 23:24:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:24:18] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Computed a total of 168 stabilizing places and 323 stable transitions
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 370 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 230 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 155 reset in 840 ms.
Product exploration explored 100000 steps with 157 reset in 848 ms.
Built C files in :
/tmp/ltsmin1025471945963344939
[2022-05-14 23:24:21] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:24:21] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1025471945963344939
Running compilation step : cd /tmp/ltsmin1025471945963344939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1025471945963344939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1025471945963344939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 289 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:24:24] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:24] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:24:25] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
[2022-05-14 23:24:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:24:25] [INFO ] Implicit Places using invariants in 314 ms returned []
[2022-05-14 23:24:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:24:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:24:26] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2022-05-14 23:24:26] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-14 23:24:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:24:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:24:27] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin16883618982342954579
[2022-05-14 23:24:27] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:24:27] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16883618982342954579
Running compilation step : cd /tmp/ltsmin16883618982342954579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16883618982342954579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16883618982342954579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 23:24:30] [INFO ] Flatten gal took : 90 ms
[2022-05-14 23:24:30] [INFO ] Flatten gal took : 88 ms
[2022-05-14 23:24:30] [INFO ] Time to serialize gal into /tmp/LTL3844565224897839493.gal : 17 ms
[2022-05-14 23:24:30] [INFO ] Time to serialize properties into /tmp/LTL8881854804823732440.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3844565224897839493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8881854804823732440.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3844565...266
Read 1 LTL properties
Checking formula 0 : !((G((F("(ATTENTE_B_0<=ROUTE_A_0)"))&&(G(F("(ATTENTE_A_0<=CAPACITE_0)"))))))
Formula 0 simplified : !G(F"(ATTENTE_B_0<=ROUTE_A_0)" & GF"(ATTENTE_A_0<=CAPACITE_0)")
Detected timeout of ITS tools.
[2022-05-14 23:24:45] [INFO ] Flatten gal took : 93 ms
[2022-05-14 23:24:45] [INFO ] Applying decomposition
[2022-05-14 23:24:46] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5751840194859005043.txt' '-o' '/tmp/graph5751840194859005043.bin' '-w' '/tmp/graph5751840194859005043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5751840194859005043.bin' '-l' '-1' '-v' '-w' '/tmp/graph5751840194859005043.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:24:46] [INFO ] Decomposing Gal with order
[2022-05-14 23:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:24:47] [INFO ] Removed a total of 2313 redundant transitions.
[2022-05-14 23:24:47] [INFO ] Flatten gal took : 784 ms
[2022-05-14 23:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 732 labels/synchronizations in 30 ms.
[2022-05-14 23:24:47] [INFO ] Time to serialize gal into /tmp/LTL6616047171836278771.gal : 11 ms
[2022-05-14 23:24:47] [INFO ] Time to serialize properties into /tmp/LTL7147883757042435619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6616047171836278771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7147883757042435619.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6616047...266
Read 1 LTL properties
Checking formula 0 : !((G((F("(gu1.ATTENTE_B_0<=gu1.ROUTE_A_0)"))&&(G(F("(gu0.ATTENTE_A_0<=gu0.CAPACITE_0)"))))))
Formula 0 simplified : !G(F"(gu1.ATTENTE_B_0<=gu1.ROUTE_A_0)" & GF"(gu0.ATTENTE_A_0<=gu0.CAPACITE_0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3363963615951240753
[2022-05-14 23:25:02] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3363963615951240753
Running compilation step : cd /tmp/ltsmin3363963615951240753;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3363963615951240753;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3363963615951240753;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-01 finished in 56901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G((!X(X(p1))||p0)))||G(p2)))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 30 ms. Remains 185 /187 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:25:05] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:25:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:06] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
[2022-05-14 23:25:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:25:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:25:06] [INFO ] Implicit Places using invariants in 324 ms returned []
[2022-05-14 23:25:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:25:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:25:07] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1527 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/187 places, 2107/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/187 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 655 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 7}, { cond=(AND p0 p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 10}, { cond=(AND p0 p2), acceptance={} source=4 dest: 11}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p2 p1), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 10}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=8 dest: 11}, { cond=(AND p2 p1), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND p0 p2), acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={} source=10 dest: 1}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2), acceptance={} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 0}, { cond=p2, acceptance={} source=12 dest: 12}]], initial=9, aps=[p0:(LEQ s82 s83), p2:(LEQ 1 s82), p1:(LEQ 1 (ADD s182 s183))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 290 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-06 finished in 3125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&p1))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 2108
Applied a total of 1 rules in 14 ms. Remains 186 /187 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:25:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:25:08] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:25:09] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
[2022-05-14 23:25:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:25:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:25:09] [INFO ] Implicit Places using invariants in 263 ms returned []
[2022-05-14 23:25:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:25:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:25:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:25:12] [INFO ] Implicit Places using invariants and state equation in 2876 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3160 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/187 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s167 s168) s166), p0:(GT 1 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 148 reset in 773 ms.
Product exploration explored 100000 steps with 148 reset in 753 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 284 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
[2022-05-14 23:25:14] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:14] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 23:25:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:25:15] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2022-05-14 23:25:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:25:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:25:16] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2022-05-14 23:25:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:25:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 1690 ms returned sat
[2022-05-14 23:25:18] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 71 ms.
[2022-05-14 23:25:18] [INFO ] Added : 28 causal constraints over 7 iterations in 378 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:25:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:19] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
[2022-05-14 23:25:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:19] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 23:25:19] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-05-14 23:25:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:25:21] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
[2022-05-14 23:25:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:22] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 273 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
[2022-05-14 23:25:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:23] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 23:25:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:25:24] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2022-05-14 23:25:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:25:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 23:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:25:24] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-14 23:25:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:25:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 1688 ms returned sat
[2022-05-14 23:25:26] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 97 ms.
[2022-05-14 23:25:26] [INFO ] Added : 28 causal constraints over 7 iterations in 400 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 148 reset in 797 ms.
Product exploration explored 100000 steps with 148 reset in 762 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 794 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 2108
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 230 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:25:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:25:30] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
[2022-05-14 23:25:30] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-14 23:25:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:30] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:25:31] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/184 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Product exploration explored 100000 steps with 168 reset in 730 ms.
Product exploration explored 100000 steps with 168 reset in 719 ms.
Built C files in :
/tmp/ltsmin15996004629417420513
[2022-05-14 23:25:32] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15996004629417420513
Running compilation step : cd /tmp/ltsmin15996004629417420513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15996004629417420513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15996004629417420513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 23 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:25:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:36] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
[2022-05-14 23:25:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:36] [INFO ] Implicit Places using invariants in 259 ms returned []
[2022-05-14 23:25:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:25:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:25:38] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
[2022-05-14 23:25:38] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:25:38] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:25:39] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin14542713423294792278
[2022-05-14 23:25:39] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14542713423294792278
Running compilation step : cd /tmp/ltsmin14542713423294792278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14542713423294792278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14542713423294792278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 23:25:42] [INFO ] Flatten gal took : 164 ms
[2022-05-14 23:25:42] [INFO ] Flatten gal took : 159 ms
[2022-05-14 23:25:42] [INFO ] Time to serialize gal into /tmp/LTL4363353253586083589.gal : 31 ms
[2022-05-14 23:25:42] [INFO ] Time to serialize properties into /tmp/LTL16142951677765734014.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4363353253586083589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16142951677765734014.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4363353...267
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(SUR_PONT_A_0<1)"))&&("((CONTROLEUR_0+CONTROLEUR_1)>ROUTE_B_0)")))))
Formula 0 simplified : !XF("((CONTROLEUR_0+CONTROLEUR_1)>ROUTE_B_0)" & G"(SUR_PONT_A_0<1)")
Detected timeout of ITS tools.
[2022-05-14 23:25:57] [INFO ] Flatten gal took : 74 ms
[2022-05-14 23:25:57] [INFO ] Applying decomposition
[2022-05-14 23:25:57] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6926770599802539680.txt' '-o' '/tmp/graph6926770599802539680.bin' '-w' '/tmp/graph6926770599802539680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6926770599802539680.bin' '-l' '-1' '-v' '-w' '/tmp/graph6926770599802539680.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:25:58] [INFO ] Decomposing Gal with order
[2022-05-14 23:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:25:58] [INFO ] Removed a total of 5557 redundant transitions.
[2022-05-14 23:25:58] [INFO ] Flatten gal took : 563 ms
[2022-05-14 23:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 835 labels/synchronizations in 70 ms.
[2022-05-14 23:25:58] [INFO ] Time to serialize gal into /tmp/LTL8288203542812649340.gal : 2 ms
[2022-05-14 23:25:58] [INFO ] Time to serialize properties into /tmp/LTL13580217973229438778.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8288203542812649340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13580217973229438778.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8288203...267
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gi1.gu0.SUR_PONT_A_0<1)"))&&("((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)>gu1.ROUTE_B_0)")))))
Formula 0 simplified : !XF("((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)>gu1.ROUTE_B_0)" & G"(gi1.gu0.SUR_PONT_A_0<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11832551620773970670
[2022-05-14 23:26:13] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11832551620773970670
Running compilation step : cd /tmp/ltsmin11832551620773970670;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11832551620773970670;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11832551620773970670;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07 finished in 68415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U !p0))||G(X((X(p1)||!p0)))))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 23 ms. Remains 185 /187 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:26:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:26:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:26:17] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
[2022-05-14 23:26:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:26:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:26:17] [INFO ] Implicit Places using invariants in 366 ms returned []
[2022-05-14 23:26:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:26:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:26:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:19] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1674 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/187 places, 2107/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/187 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 149 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT s83 1), p1:(LEQ 3 s83)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 896 ms.
Product exploration explored 100000 steps with 50000 reset in 891 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09 finished in 4579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(F((!G(p0)||F(p1)))))) U p0)))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 24 ms. Remains 187 /187 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:26:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:26:21] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-14 23:26:22] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
[2022-05-14 23:26:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:26:22] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 23:26:22] [INFO ] Implicit Places using invariants in 324 ms returned []
[2022-05-14 23:26:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:26:22] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 23:26:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:23] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1587 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 186/187 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s167 s166), p1:(AND (LEQ 1 s168) (LEQ s167 s166))], 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 151 reset in 800 ms.
Product exploration explored 100000 steps with 152 reset in 795 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 9261 steps, including 13 resets, run visited all 2 properties in 76 ms. (steps per millisecond=121 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 614 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2022-05-14 23:26:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:27] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-14 23:26:27] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-14 23:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:28] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2022-05-14 23:26:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:26:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 23:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:29] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-05-14 23:26:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 81 ms returned sat
[2022-05-14 23:26:29] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 53 ms.
[2022-05-14 23:26:29] [INFO ] Added : 12 causal constraints over 3 iterations in 200 ms. Result :sat
Could not prove EG (NOT p0)
[2022-05-14 23:26:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:29] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 23:26:30] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-14 23:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:30] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-05-14 23:26:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:26:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 23:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:32] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2022-05-14 23:26:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 861 ms returned sat
[2022-05-14 23:26:33] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 46 ms.
[2022-05-14 23:26:33] [INFO ] Added : 11 causal constraints over 3 iterations in 422 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:26:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 23:26:34] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
[2022-05-14 23:26:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:34] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 23:26:34] [INFO ] Implicit Places using invariants in 338 ms returned []
[2022-05-14 23:26:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:34] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-14 23:26:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:35] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2022-05-14 23:26:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:35] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 23:26:35] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 2108/2108 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 732 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :1
Finished Best-First random walk after 160 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 362 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2022-05-14 23:26:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:37] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-14 23:26:38] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 23:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:38] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2022-05-14 23:26:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:26:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 23:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:39] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2022-05-14 23:26:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 79 ms returned sat
[2022-05-14 23:26:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 61 ms.
[2022-05-14 23:26:40] [INFO ] Added : 12 causal constraints over 3 iterations in 208 ms. Result :sat
Could not prove EG (NOT p0)
[2022-05-14 23:26:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:40] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 23:26:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-14 23:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:40] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-05-14 23:26:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:26:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 23:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:26:42] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2022-05-14 23:26:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 847 ms returned sat
[2022-05-14 23:26:43] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 50 ms.
[2022-05-14 23:26:43] [INFO ] Added : 11 causal constraints over 3 iterations in 441 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 149 reset in 799 ms.
Product exploration explored 100000 steps with 149 reset in 788 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 171 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:26:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:45] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 23:26:46] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
[2022-05-14 23:26:46] [INFO ] Redundant transitions in 60 ms returned []
[2022-05-14 23:26:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:46] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-14 23:26:46] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/186 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 2108/2108 transitions.
Product exploration explored 100000 steps with 170 reset in 783 ms.
Product exploration explored 100000 steps with 170 reset in 785 ms.
Built C files in :
/tmp/ltsmin2944623461482086104
[2022-05-14 23:26:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2944623461482086104
Running compilation step : cd /tmp/ltsmin2944623461482086104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2944623461482086104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2944623461482086104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 17 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:26:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:51] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 23:26:52] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
[2022-05-14 23:26:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:52] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 23:26:52] [INFO ] Implicit Places using invariants in 324 ms returned []
[2022-05-14 23:26:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:52] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-14 23:26:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:26:53] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2022-05-14 23:26:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:26:53] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 23:26:54] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin15185921639313829437
[2022-05-14 23:26:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15185921639313829437
Running compilation step : cd /tmp/ltsmin15185921639313829437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15185921639313829437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15185921639313829437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 23:26:57] [INFO ] Flatten gal took : 67 ms
[2022-05-14 23:26:57] [INFO ] Flatten gal took : 95 ms
[2022-05-14 23:26:57] [INFO ] Time to serialize gal into /tmp/LTL622130169727905104.gal : 9 ms
[2022-05-14 23:26:57] [INFO ] Time to serialize properties into /tmp/LTL18273992803092764922.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL622130169727905104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18273992803092764922.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6221301...266
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G(F((!(G("(ROUTE_B_0<=ATTENTE_B_0)")))||(F("((SORTI_B_0>=1)&&(ROUTE_B_0<=ATTENTE_B_0))")))))))U("(ROUTE_B_0<=ATTENTE_B_0)"))...157
Formula 0 simplified : !X(XXGF(!G"(ROUTE_B_0<=ATTENTE_B_0)" | F"((SORTI_B_0>=1)&&(ROUTE_B_0<=ATTENTE_B_0))") U "(ROUTE_B_0<=ATTENTE_B_0)")
Detected timeout of ITS tools.
[2022-05-14 23:27:12] [INFO ] Flatten gal took : 63 ms
[2022-05-14 23:27:12] [INFO ] Applying decomposition
[2022-05-14 23:27:12] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17653150020926453440.txt' '-o' '/tmp/graph17653150020926453440.bin' '-w' '/tmp/graph17653150020926453440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17653150020926453440.bin' '-l' '-1' '-v' '-w' '/tmp/graph17653150020926453440.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:27:12] [INFO ] Decomposing Gal with order
[2022-05-14 23:27:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:27:13] [INFO ] Removed a total of 2153 redundant transitions.
[2022-05-14 23:27:13] [INFO ] Flatten gal took : 575 ms
[2022-05-14 23:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 495 labels/synchronizations in 9 ms.
[2022-05-14 23:27:13] [INFO ] Time to serialize gal into /tmp/LTL17967001710539445160.gal : 5 ms
[2022-05-14 23:27:15] [INFO ] Time to serialize properties into /tmp/LTL11184982980761057750.ltl : 1516 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17967001710539445160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11184982980761057750.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1796700...268
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G(F((!(G("(gu2.ROUTE_B_0<=gu2.ATTENTE_B_0)")))||(F("((gi1.gu0.SORTI_B_0>=1)&&(gu2.ROUTE_B_0<=gu2.ATTENTE_B_0))")))))))U("(gu...189
Formula 0 simplified : !X(XXGF(!G"(gu2.ROUTE_B_0<=gu2.ATTENTE_B_0)" | F"((gi1.gu0.SORTI_B_0>=1)&&(gu2.ROUTE_B_0<=gu2.ATTENTE_B_0))") U "(gu2.ROUTE_B_0<=gu2...170
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16570379549427919543
[2022-05-14 23:27:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16570379549427919543
Running compilation step : cd /tmp/ltsmin16570379549427919543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16570379549427919543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16570379549427919543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-10 finished in 71653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(X(G(p0))))&&p1)))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 187 /187 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:27:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:27:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 23:27:33] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2022-05-14 23:27:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:27:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 23:27:34] [INFO ] Implicit Places using invariants in 337 ms returned []
[2022-05-14 23:27:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2022-05-14 23:27:34] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 23:27:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:27:35] [INFO ] Implicit Places using invariants and state equation in 922 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1264 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 186/187 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s167 s83), p0:(OR (LEQ s167 s83) (LEQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 148 reset in 809 ms.
Product exploration explored 100000 steps with 148 reset in 806 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 182 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:27:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:27:38] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
[2022-05-14 23:27:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:27:38] [INFO ] Implicit Places using invariants in 312 ms returned []
[2022-05-14 23:27:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:27:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:27:39] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2022-05-14 23:27:39] [INFO ] Redundant transitions in 62 ms returned []
[2022-05-14 23:27:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:27:40] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/186 places, 2107/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/186 places, 2107/2108 transitions.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 115 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 168 reset in 811 ms.
Product exploration explored 100000 steps with 168 reset in 829 ms.
Built C files in :
/tmp/ltsmin11447097358074281119
[2022-05-14 23:27:42] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:27:42] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11447097358074281119
Running compilation step : cd /tmp/ltsmin11447097358074281119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11447097358074281119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11447097358074281119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 174 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:27:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:27:46] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
[2022-05-14 23:27:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:27:46] [INFO ] Implicit Places using invariants in 315 ms returned []
[2022-05-14 23:27:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:27:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:27:47] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2022-05-14 23:27:47] [INFO ] Redundant transitions in 60 ms returned []
[2022-05-14 23:27:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:27:47] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:27:47] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin15701905672994865611
[2022-05-14 23:27:47] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:27:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15701905672994865611
Running compilation step : cd /tmp/ltsmin15701905672994865611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15701905672994865611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15701905672994865611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 23:27:51] [INFO ] Flatten gal took : 66 ms
[2022-05-14 23:27:51] [INFO ] Flatten gal took : 85 ms
[2022-05-14 23:27:51] [INFO ] Time to serialize gal into /tmp/LTL10852960043790670802.gal : 22 ms
[2022-05-14 23:27:51] [INFO ] Time to serialize properties into /tmp/LTL9112802964371682008.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10852960043790670802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9112802964371682008.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1085296...267
Read 1 LTL properties
Checking formula 0 : !((X((F(G(X(G("((ROUTE_B_0<=ATTENTE_A_0)||(SORTI_B_0<=1))")))))&&("(ROUTE_B_0>ATTENTE_A_0)"))))
Formula 0 simplified : !X("(ROUTE_B_0>ATTENTE_A_0)" & FGXG"((ROUTE_B_0<=ATTENTE_A_0)||(SORTI_B_0<=1))")
Detected timeout of ITS tools.
[2022-05-14 23:28:06] [INFO ] Flatten gal took : 62 ms
[2022-05-14 23:28:06] [INFO ] Applying decomposition
[2022-05-14 23:28:06] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11181086932950204487.txt' '-o' '/tmp/graph11181086932950204487.bin' '-w' '/tmp/graph11181086932950204487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11181086932950204487.bin' '-l' '-1' '-v' '-w' '/tmp/graph11181086932950204487.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:28:06] [INFO ] Decomposing Gal with order
[2022-05-14 23:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:28:07] [INFO ] Removed a total of 2084 redundant transitions.
[2022-05-14 23:28:07] [INFO ] Flatten gal took : 526 ms
[2022-05-14 23:28:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 664 labels/synchronizations in 13 ms.
[2022-05-14 23:28:07] [INFO ] Time to serialize gal into /tmp/LTL6570620620775506429.gal : 5 ms
[2022-05-14 23:28:07] [INFO ] Time to serialize properties into /tmp/LTL4498606041920400921.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6570620620775506429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4498606041920400921.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6570620...266
Read 1 LTL properties
Checking formula 0 : !((X((F(G(X(G("((gu1.ROUTE_B_0<=gu1.ATTENTE_A_0)||(gi0.gu2.SORTI_B_0<=1))")))))&&("(gu1.ROUTE_B_0>gu1.ATTENTE_A_0)"))))
Formula 0 simplified : !X("(gu1.ROUTE_B_0>gu1.ATTENTE_A_0)" & FGXG"((gu1.ROUTE_B_0<=gu1.ATTENTE_A_0)||(gi0.gu2.SORTI_B_0<=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin887982684950807960
[2022-05-14 23:28:22] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin887982684950807960
Running compilation step : cd /tmp/ltsmin887982684950807960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin887982684950807960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin887982684950807960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-11 finished in 52159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((true U G((!p0 U X(F(X(!p0))))))))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Graph (complete) has 4309 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 163 ms. Remains 185 /187 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:28:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:28:25] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:28:26] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
[2022-05-14 23:28:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:28:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:28:26] [INFO ] Implicit Places using invariants in 392 ms returned []
[2022-05-14 23:28:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:28:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:28:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:28:29] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3058 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/187 places, 2107/2108 transitions.
Applied a total of 0 rules in 149 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/187 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 196 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s84)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4982 reset in 620 ms.
Product exploration explored 100000 steps with 4897 reset in 620 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Finished random walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
[2022-05-14 23:28:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:28:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:28:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 23:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:28:32] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2022-05-14 23:28:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:28:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 23:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:28:33] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2022-05-14 23:28:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:28:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 150 ms returned sat
[2022-05-14 23:28:33] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 46 ms.
[2022-05-14 23:28:33] [INFO ] Added : 14 causal constraints over 4 iterations in 175 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 151 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:28:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:28:34] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:28:34] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2022-05-14 23:28:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:28:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:28:35] [INFO ] Implicit Places using invariants in 333 ms returned []
[2022-05-14 23:28:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:28:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:28:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:28:36] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1803 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 153 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/184 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
[2022-05-14 23:28:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:28:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:28:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:28:38] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2022-05-14 23:28:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:28:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 23:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:28:39] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2022-05-14 23:28:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:28:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 85 ms returned sat
[2022-05-14 23:28:39] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 43 ms.
[2022-05-14 23:28:39] [INFO ] Added : 11 causal constraints over 3 iterations in 159 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Product exploration explored 100000 steps with 4919 reset in 568 ms.
Product exploration explored 100000 steps with 4804 reset in 563 ms.
Built C files in :
/tmp/ltsmin7720118750747501611
[2022-05-14 23:28:41] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:28:41] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7720118750747501611
Running compilation step : cd /tmp/ltsmin7720118750747501611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7720118750747501611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7720118750747501611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 145 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:28:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:28:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:28:44] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
[2022-05-14 23:28:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:28:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:28:45] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-05-14 23:28:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:28:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:28:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:28:46] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2022-05-14 23:28:46] [INFO ] Redundant transitions in 59 ms returned []
[2022-05-14 23:28:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:28:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:28:46] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin6267914788515729805
[2022-05-14 23:28:46] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:28:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6267914788515729805
Running compilation step : cd /tmp/ltsmin6267914788515729805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6267914788515729805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6267914788515729805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 23:28:49] [INFO ] Flatten gal took : 64 ms
[2022-05-14 23:28:50] [INFO ] Flatten gal took : 71 ms
[2022-05-14 23:28:50] [INFO ] Time to serialize gal into /tmp/LTL15935880234964848709.gal : 8 ms
[2022-05-14 23:28:50] [INFO ] Time to serialize properties into /tmp/LTL9035641002182259999.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15935880234964848709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9035641002182259999.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1593588...267
Read 1 LTL properties
Checking formula 0 : !((F(F(G(("(SUR_PONT_A_0>=1)")U(X(F(X("(SUR_PONT_A_0>=1)")))))))))
Formula 0 simplified : !FG("(SUR_PONT_A_0>=1)" U XFX"(SUR_PONT_A_0>=1)")
Detected timeout of ITS tools.
[2022-05-14 23:29:05] [INFO ] Flatten gal took : 61 ms
[2022-05-14 23:29:05] [INFO ] Applying decomposition
[2022-05-14 23:29:05] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17547462123146401366.txt' '-o' '/tmp/graph17547462123146401366.bin' '-w' '/tmp/graph17547462123146401366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17547462123146401366.bin' '-l' '-1' '-v' '-w' '/tmp/graph17547462123146401366.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:29:05] [INFO ] Decomposing Gal with order
[2022-05-14 23:29:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:29:05] [INFO ] Removed a total of 4593 redundant transitions.
[2022-05-14 23:29:05] [INFO ] Flatten gal took : 380 ms
[2022-05-14 23:29:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 507 labels/synchronizations in 27 ms.
[2022-05-14 23:29:05] [INFO ] Time to serialize gal into /tmp/LTL17882776839034586348.gal : 2 ms
[2022-05-14 23:29:05] [INFO ] Time to serialize properties into /tmp/LTL157968843807888069.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17882776839034586348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL157968843807888069.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1788277...245
Read 1 LTL properties
Checking formula 0 : !((F(F(G(("(i2.u0.SUR_PONT_A_0>=1)")U(X(F(X("(i2.u0.SUR_PONT_A_0>=1)")))))))))
Formula 0 simplified : !FG("(i2.u0.SUR_PONT_A_0>=1)" U XFX"(i2.u0.SUR_PONT_A_0>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13975045958898814918
[2022-05-14 23:29:20] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13975045958898814918
Running compilation step : cd /tmp/ltsmin13975045958898814918;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13975045958898814918;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13975045958898814918;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-14 finished in 58628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&G(F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&p1))))'
Found a CL insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Graph (complete) has 4309 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 55 ms. Remains 185 /187 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:29:24] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:29:24] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:29:24] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
[2022-05-14 23:29:24] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:29:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:29:25] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-05-14 23:29:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:29:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:29:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:29:26] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2042 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 184/187 places, 2107/2108 transitions.
Applied a total of 0 rules in 25 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/187 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s167 s168) s166), p0:(GT 1 s84)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 168 reset in 813 ms.
Product exploration explored 100000 steps with 168 reset in 820 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 251 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
[2022-05-14 23:29:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:29:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:29:29] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 23:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:29:30] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2022-05-14 23:29:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:29:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 23:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:29:31] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2022-05-14 23:29:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:29:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 410 ms returned sat
[2022-05-14 23:29:31] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 50 ms.
[2022-05-14 23:29:31] [INFO ] Added : 28 causal constraints over 7 iterations in 301 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 16 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:29:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:29:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:29:32] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
[2022-05-14 23:29:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:29:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:29:32] [INFO ] Implicit Places using invariants in 261 ms returned []
[2022-05-14 23:29:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:29:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:29:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:29:34] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1552 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/184 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 272 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
[2022-05-14 23:29:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:29:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:29:35] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-14 23:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:29:35] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2022-05-14 23:29:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:29:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 23:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:29:36] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2022-05-14 23:29:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:29:36] [INFO ] [Nat]Added 22 Read/Feed constraints in 122 ms returned sat
[2022-05-14 23:29:36] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 46 ms.
[2022-05-14 23:29:37] [INFO ] Added : 32 causal constraints over 7 iterations in 328 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 168 reset in 760 ms.
Product exploration explored 100000 steps with 168 reset in 757 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 173 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:29:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:29:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:29:39] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
[2022-05-14 23:29:39] [INFO ] Redundant transitions in 39 ms returned []
[2022-05-14 23:29:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:29:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:29:40] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Product exploration explored 100000 steps with 168 reset in 720 ms.
Product exploration explored 100000 steps with 168 reset in 730 ms.
Built C files in :
/tmp/ltsmin18259216518255306249
[2022-05-14 23:29:41] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18259216518255306249
Running compilation step : cd /tmp/ltsmin18259216518255306249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18259216518255306249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18259216518255306249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:29:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:29:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:29:45] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
[2022-05-14 23:29:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:29:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:29:45] [INFO ] Implicit Places using invariants in 262 ms returned []
[2022-05-14 23:29:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:29:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:29:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:29:46] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2022-05-14 23:29:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:29:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:29:46] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin11850693592143187727
[2022-05-14 23:29:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11850693592143187727
Running compilation step : cd /tmp/ltsmin11850693592143187727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11850693592143187727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11850693592143187727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 23:29:50] [INFO ] Flatten gal took : 62 ms
[2022-05-14 23:29:50] [INFO ] Flatten gal took : 59 ms
[2022-05-14 23:29:50] [INFO ] Time to serialize gal into /tmp/LTL5383098901987562821.gal : 8 ms
[2022-05-14 23:29:50] [INFO ] Time to serialize properties into /tmp/LTL6801074952630515322.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5383098901987562821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6801074952630515322.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5383098...266
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(SUR_PONT_A_0<1)"))&&("((CONTROLEUR_0+CONTROLEUR_1)>ROUTE_B_0)")))))
Formula 0 simplified : !XF("((CONTROLEUR_0+CONTROLEUR_1)>ROUTE_B_0)" & G"(SUR_PONT_A_0<1)")
Detected timeout of ITS tools.
[2022-05-14 23:30:05] [INFO ] Flatten gal took : 57 ms
[2022-05-14 23:30:05] [INFO ] Applying decomposition
[2022-05-14 23:30:05] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13244260774984823999.txt' '-o' '/tmp/graph13244260774984823999.bin' '-w' '/tmp/graph13244260774984823999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13244260774984823999.bin' '-l' '-1' '-v' '-w' '/tmp/graph13244260774984823999.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:30:05] [INFO ] Decomposing Gal with order
[2022-05-14 23:30:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:30:06] [INFO ] Removed a total of 3876 redundant transitions.
[2022-05-14 23:30:06] [INFO ] Flatten gal took : 1068 ms
[2022-05-14 23:30:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2435 labels/synchronizations in 78 ms.
[2022-05-14 23:30:06] [INFO ] Time to serialize gal into /tmp/LTL16494711957399024231.gal : 4 ms
[2022-05-14 23:30:06] [INFO ] Time to serialize properties into /tmp/LTL4528361134778812191.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16494711957399024231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4528361134778812191.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1649471...267
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gi1.gu0.SUR_PONT_A_0<1)"))&&("((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>gu2.ROUTE_B_0)")))))
Formula 0 simplified : !XF("((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>gu2.ROUTE_B_0)" & G"(gi1.gu0.SUR_PONT_A_0<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin920418072643450874
[2022-05-14 23:30:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin920418072643450874
Running compilation step : cd /tmp/ltsmin920418072643450874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin920418072643450874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin920418072643450874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07 finished in 60875 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(F((!G(p0)||F(p1)))))) U p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(X(G(p0))))&&p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((true U G((!p0 U X(F(X(!p0))))))))'
[2022-05-14 23:30:25] [INFO ] Flatten gal took : 63 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9773190781089050773
[2022-05-14 23:30:25] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:30:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9773190781089050773
Running compilation step : cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-14 23:30:25] [INFO ] Applying decomposition
[2022-05-14 23:30:25] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15476920567706757593.txt' '-o' '/tmp/graph15476920567706757593.bin' '-w' '/tmp/graph15476920567706757593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15476920567706757593.bin' '-l' '-1' '-v' '-w' '/tmp/graph15476920567706757593.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:30:25] [INFO ] Decomposing Gal with order
[2022-05-14 23:30:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:30:27] [INFO ] Removed a total of 4094 redundant transitions.
[2022-05-14 23:30:27] [INFO ] Flatten gal took : 1619 ms
[2022-05-14 23:30:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2614 labels/synchronizations in 63 ms.
[2022-05-14 23:30:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality15647773233442976659.gal : 5 ms
[2022-05-14 23:30:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality15131500228156618719.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15647773233442976659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15131500228156618719.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 5 LTL properties
Checking formula 0 : !((G((F("(gu2.ATTENTE_B_0<=gu2.ROUTE_A_0)"))&&(G(F("(gu0.ATTENTE_A_0<=gu0.CAPACITE_0)"))))))
Formula 0 simplified : !G(F"(gu2.ATTENTE_B_0<=gu2.ROUTE_A_0)" & GF"(gu0.ATTENTE_A_0<=gu0.CAPACITE_0)")
Compilation finished in 4516 ms.
Running link step : cd /tmp/ltsmin9773190781089050773;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 23:52:34] [INFO ] Applying decomposition
[2022-05-14 23:52:35] [INFO ] Flatten gal took : 226 ms
[2022-05-14 23:52:35] [INFO ] Decomposing Gal with order
[2022-05-14 23:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:52:35] [INFO ] Removed a total of 11550 redundant transitions.
[2022-05-14 23:52:35] [INFO ] Flatten gal took : 400 ms
[2022-05-14 23:52:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 62 ms.
[2022-05-14 23:52:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality17161124287747313076.gal : 19 ms
[2022-05-14 23:52:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality16409322530380378488.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17161124287747313076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16409322530380378488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 5 LTL properties
Checking formula 0 : !((G((F("(gATTENTE_B.ATTENTE_B_0<=gROUTE_A.ROUTE_A_0)"))&&(G(F("(gATTENTE_A.ATTENTE_A_0<=gCAPACITE.CAPACITE_0)"))))))
Formula 0 simplified : !G(F"(gATTENTE_B.ATTENTE_B_0<=gROUTE_A.ROUTE_A_0)" & GF"(gATTENTE_A.ATTENTE_A_0<=gCAPACITE.CAPACITE_0)")
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X([](<>(()||<>((LTLAPp5==true))))))) U (LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X([](<>(()||<>((LTLAPp5==true))))))) U (LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([](X([]((LTLAPp6==true)))))&&(LTLAPp7==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 00:14:43] [INFO ] Flatten gal took : 138 ms
[2022-05-15 00:14:44] [INFO ] Input system was already deterministic with 2108 transitions.
[2022-05-15 00:14:44] [INFO ] Transformed 187 places.
[2022-05-15 00:14:44] [INFO ] Transformed 2108 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 00:14:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality5230456105765248799.gal : 19 ms
[2022-05-15 00:14:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality16629400196054108065.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5230456105765248799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16629400196054108065.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("(ATTENTE_B_0<=ROUTE_A_0)"))&&(G(F("(ATTENTE_A_0<=CAPACITE_0)"))))))
Formula 0 simplified : !G(F"(ATTENTE_B_0<=ROUTE_A_0)" & GF"(ATTENTE_A_0<=CAPACITE_0)")
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([](X([]((LTLAPp6==true)))))&&(LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9773190781089050773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((true U []((!(LTLAPp2==true) U X(<>(X(!(LTLAPp2==true))))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P50N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V80P50N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918100139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;