About the Execution of 2023-gold for AutoFlight-PT-96b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.392 | 3600000.00 | 11476322.00 | 163238.80 | FT?F?FFFF?FFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180200133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutoFlight-PT-96b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180200133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 22:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 22:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716301997599
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 14:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 14:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:33:21] [INFO ] Load time of PNML (sax parser for PT used): 678 ms
[2024-05-21 14:33:21] [INFO ] Transformed 7894 places.
[2024-05-21 14:33:21] [INFO ] Transformed 7868 transitions.
[2024-05-21 14:33:21] [INFO ] Found NUPN structural information;
[2024-05-21 14:33:21] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 1165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-96b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 7894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Discarding 1008 places :
Symmetric choice reduction at 0 with 1008 rule applications. Total rules 1008 place count 6886 transition count 6860
Iterating global reduction 0 with 1008 rules applied. Total rules applied 2016 place count 6886 transition count 6860
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 0 with 143 rules applied. Total rules applied 2159 place count 6886 transition count 6717
Discarding 475 places :
Symmetric choice reduction at 1 with 475 rule applications. Total rules 2634 place count 6411 transition count 6242
Iterating global reduction 1 with 475 rules applied. Total rules applied 3109 place count 6411 transition count 6242
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 3180 place count 6340 transition count 6171
Iterating global reduction 1 with 71 rules applied. Total rules applied 3251 place count 6340 transition count 6171
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 3321 place count 6270 transition count 6101
Iterating global reduction 1 with 70 rules applied. Total rules applied 3391 place count 6270 transition count 6101
Applied a total of 3391 rules in 8305 ms. Remains 6270 /7894 variables (removed 1624) and now considering 6101/7868 (removed 1767) transitions.
// Phase 1: matrix 6101 rows 6270 cols
[2024-05-21 14:33:30] [INFO ] Computed 514 invariants in 167 ms
[2024-05-21 14:33:32] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2024-05-21 14:33:32] [INFO ] Invariant cache hit.
[2024-05-21 14:33:33] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 2575 ms to find 0 implicit places.
[2024-05-21 14:33:33] [INFO ] Invariant cache hit.
[2024-05-21 14:33:34] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6270/7894 places, 6101/7868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11925 ms. Remains : 6270/7894 places, 6101/7868 transitions.
Support contains 33 out of 6270 places after structural reductions.
[2024-05-21 14:33:35] [INFO ] Flatten gal took : 562 ms
[2024-05-21 14:33:35] [INFO ] Flatten gal took : 255 ms
[2024-05-21 14:33:36] [INFO ] Input system was already deterministic with 6101 transitions.
Support contains 32 out of 6270 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 942 ms. (steps per millisecond=10 ) properties (out of 25) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-21 14:33:37] [INFO ] Invariant cache hit.
[2024-05-21 14:33:42] [INFO ] [Real]Absence check using 513 positive place invariants in 1387 ms returned sat
[2024-05-21 14:33:42] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 72 ms returned sat
[2024-05-21 14:33:44] [INFO ] After 7348ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2024-05-21 14:33:49] [INFO ] [Nat]Absence check using 513 positive place invariants in 1373 ms returned sat
[2024-05-21 14:33:49] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 61 ms returned sat
[2024-05-21 14:34:07] [INFO ] After 14961ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2024-05-21 14:34:13] [INFO ] Deduced a trap composed of 238 places in 6084 ms of which 7 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 14:34:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 14:34:13] [INFO ] After 28853ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:15
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 7 properties in 2850 ms.
Support contains 10 out of 6270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Drop transitions removed 2538 transitions
Trivial Post-agglo rules discarded 2538 transitions
Performed 2538 trivial Post agglomeration. Transition count delta: 2538
Iterating post reduction 0 with 2538 rules applied. Total rules applied 2538 place count 6270 transition count 3563
Reduce places removed 2538 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2827 rules applied. Total rules applied 5365 place count 3732 transition count 3274
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5558 place count 3540 transition count 3273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5559 place count 3539 transition count 3273
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5559 place count 3539 transition count 2570
Deduced a syphon composed of 703 places in 41 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6965 place count 2836 transition count 2570
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 6970 place count 2831 transition count 2565
Iterating global reduction 4 with 5 rules applied. Total rules applied 6975 place count 2831 transition count 2565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 6975 place count 2831 transition count 2563
Deduced a syphon composed of 2 places in 73 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 6979 place count 2829 transition count 2563
Performed 1143 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1143 places in 2 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9265 place count 1686 transition count 1278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9267 place count 1686 transition count 1276
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 288 times.
Iterating global reduction 5 with 288 rules applied. Total rules applied 9555 place count 1686 transition count 988
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 5 with 288 rules applied. Total rules applied 9843 place count 1398 transition count 988
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9844 place count 1397 transition count 987
Reduce places removed 400 places and 0 transitions.
Drop transitions removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 6 with 1023 rules applied. Total rules applied 10867 place count 997 transition count 364
Reduce places removed 623 places and 0 transitions.
Iterating post reduction 7 with 623 rules applied. Total rules applied 11490 place count 374 transition count 364
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 123 Pre rules applied. Total rules applied 11490 place count 374 transition count 241
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 8 with 246 rules applied. Total rules applied 11736 place count 251 transition count 241
Applied a total of 11736 rules in 2154 ms. Remains 251 /6270 variables (removed 6019) and now considering 241/6101 (removed 5860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2154 ms. Remains : 251/6270 places, 241/6101 transitions.
Finished random walk after 696 steps, including 5 resets, run visited all 8 properties in 32 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-96b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1588 stabilizing places and 1588 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p1)) U p2)||F(p0)))'
Support contains 4 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6261 transition count 6092
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6261 transition count 6092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 6261 transition count 6091
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 6258 transition count 6088
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 6258 transition count 6088
Applied a total of 25 rules in 4020 ms. Remains 6258 /6270 variables (removed 12) and now considering 6088/6101 (removed 13) transitions.
// Phase 1: matrix 6088 rows 6258 cols
[2024-05-21 14:34:23] [INFO ] Computed 514 invariants in 140 ms
[2024-05-21 14:34:24] [INFO ] Implicit Places using invariants in 1036 ms returned []
[2024-05-21 14:34:24] [INFO ] Invariant cache hit.
[2024-05-21 14:34:25] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2024-05-21 14:34:25] [INFO ] Invariant cache hit.
[2024-05-21 14:34:26] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6258/6270 places, 6088/6101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7064 ms. Remains : 6258/6270 places, 6088/6101 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1057 1) (EQ s187 1)), p0:(EQ s786 1), p1:(EQ s3246 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29 reset in 982 ms.
Product exploration explored 100000 steps with 29 reset in 1456 ms.
Computed a total of 1582 stabilizing places and 1582 stable transitions
Computed a total of 1582 stabilizing places and 1582 stable transitions
Detected a total of 1582/6258 stabilizing places and 1582/6088 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 76438 steps, run visited all 1 properties in 723 ms. (steps per millisecond=105 )
Probabilistic random walk after 76438 steps, saw 75936 distinct states, run finished after 727 ms. (steps per millisecond=105 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-21 14:34:32] [INFO ] Invariant cache hit.
[2024-05-21 14:34:41] [INFO ] [Real]Absence check using 513 positive place invariants in 2855 ms returned sat
[2024-05-21 14:34:41] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 55 ms returned sat
[2024-05-21 14:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 14:34:47] [INFO ] [Real]Absence check using state equation in 5172 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 6258 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6258/6258 places, 6088/6088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2539 transitions
Trivial Post-agglo rules discarded 2539 transitions
Performed 2539 trivial Post agglomeration. Transition count delta: 2539
Iterating post reduction 0 with 2539 rules applied. Total rules applied 2539 place count 6257 transition count 3548
Reduce places removed 2539 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5363 place count 3718 transition count 3263
Reduce places removed 190 places and 0 transitions.
Iterating post reduction 2 with 190 rules applied. Total rules applied 5553 place count 3528 transition count 3263
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 702 Pre rules applied. Total rules applied 5553 place count 3528 transition count 2561
Deduced a syphon composed of 702 places in 59 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 6957 place count 2826 transition count 2561
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 0 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 3 with 2286 rules applied. Total rules applied 9243 place count 1683 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9244 place count 1682 transition count 1273
Reduce places removed 182 places and 0 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 3 with 272 rules applied. Total rules applied 9516 place count 1500 transition count 1183
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 9606 place count 1410 transition count 1183
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 92 Pre rules applied. Total rules applied 9606 place count 1410 transition count 1091
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 5 with 184 rules applied. Total rules applied 9790 place count 1318 transition count 1091
Applied a total of 9790 rules in 1307 ms. Remains 1318 /6258 variables (removed 4940) and now considering 1091/6088 (removed 4997) transitions.
// Phase 1: matrix 1091 rows 1318 cols
[2024-05-21 14:34:48] [INFO ] Computed 332 invariants in 7 ms
[2024-05-21 14:34:49] [INFO ] Implicit Places using invariants in 1465 ms returned [522, 596, 670, 708, 746, 820, 894, 932, 970, 976, 982, 988, 994, 999, 1003, 1007, 1011, 1015, 1019, 1023, 1027, 1031, 1035, 1039, 1043, 1047, 1051, 1055, 1059, 1063, 1067, 1071, 1075, 1079, 1083, 1087, 1091, 1095, 1099, 1103, 1107, 1111, 1115, 1119, 1123, 1127, 1131, 1135, 1139, 1143, 1147, 1151, 1155, 1159, 1163, 1167, 1171, 1173, 1175, 1177, 1179, 1181, 1183, 1185, 1187, 1189, 1191, 1193, 1195, 1199, 1203, 1207, 1211, 1215, 1219, 1223, 1227, 1231, 1235, 1239, 1243, 1245, 1247, 1249, 1251, 1253, 1255, 1257, 1259, 1261, 1263, 1265, 1267, 1271, 1275, 1279, 1283, 1287, 1291, 1296, 1300, 1304, 1308, 1312, 1317]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1470 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1213/6258 places, 1091/6088 transitions.
Graph (trivial) has 497 edges and 1213 vertex of which 25 / 1213 are part of one of the 1 SCC in 10 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1110 transition count 965
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1110 transition count 965
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1106 transition count 961
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1106 transition count 961
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1102 transition count 957
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1102 transition count 957
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1098 transition count 953
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1098 transition count 953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1094 transition count 949
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1094 transition count 949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1090 transition count 945
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1090 transition count 945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1086 transition count 941
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1086 transition count 941
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1082 transition count 937
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1082 transition count 937
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1078 transition count 933
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1078 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1074 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1074 transition count 929
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1070 transition count 925
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1070 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1066 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1066 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1062 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1062 transition count 917
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1060 transition count 915
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1060 transition count 915
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1058 transition count 913
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1058 transition count 913
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1056 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1056 transition count 911
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1054 transition count 909
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1054 transition count 909
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1052 transition count 907
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1052 transition count 907
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1050 transition count 905
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1050 transition count 905
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1048 transition count 903
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1048 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1046 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1046 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1044 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1044 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1042 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1042 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1040 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1040 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1038 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1038 transition count 893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1037 transition count 892
Applied a total of 305 rules in 1002 ms. Remains 1037 /1213 variables (removed 176) and now considering 892/1091 (removed 199) transitions.
// Phase 1: matrix 892 rows 1037 cols
[2024-05-21 14:34:50] [INFO ] Computed 227 invariants in 21 ms
[2024-05-21 14:34:51] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-21 14:34:51] [INFO ] Invariant cache hit.
[2024-05-21 14:34:52] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 14:35:00] [INFO ] Implicit Places using invariants and state equation in 8530 ms returned [510, 512, 514, 516]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9507 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1033/6258 places, 892/6088 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 1033 transition count 888
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1029 transition count 888
Applied a total of 8 rules in 47 ms. Remains 1029 /1033 variables (removed 4) and now considering 888/892 (removed 4) transitions.
// Phase 1: matrix 888 rows 1029 cols
[2024-05-21 14:35:00] [INFO ] Computed 223 invariants in 6 ms
[2024-05-21 14:35:01] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-21 14:35:01] [INFO ] Invariant cache hit.
[2024-05-21 14:35:02] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 14:35:12] [INFO ] Implicit Places using invariants and state equation in 10932 ms returned []
Implicit Place search using SMT with State Equation took 12035 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1029/6258 places, 888/6088 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 25373 ms. Remains : 1029/6258 places, 888/6088 transitions.
Computed a total of 11 stabilizing places and 6 stable transitions
Computed a total of 11 stabilizing places and 6 stable transitions
Detected a total of 11/1029 stabilizing places and 6/888 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 222 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-21 14:35:12] [INFO ] Invariant cache hit.
[2024-05-21 14:35:14] [INFO ] [Real]Absence check using 223 positive place invariants in 110 ms returned sat
[2024-05-21 14:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 14:35:18] [INFO ] [Real]Absence check using state equation in 4027 ms returned sat
[2024-05-21 14:35:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:35:19] [INFO ] [Nat]Absence check using 223 positive place invariants in 232 ms returned sat
[2024-05-21 14:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 14:35:21] [INFO ] [Nat]Absence check using state equation in 1829 ms returned sat
[2024-05-21 14:35:21] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 14:35:21] [INFO ] [Nat]Added 221 Read/Feed constraints in 55 ms returned sat
[2024-05-21 14:35:21] [INFO ] Computed and/alt/rep : 804/2039/804 causal constraints (skipped 0 transitions) in 75 ms.
[2024-05-21 14:35:26] [INFO ] Added : 291 causal constraints over 59 iterations in 4802 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-00 finished in 66712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(F((p0&&X((p0 U (!p1||G(p0)))))))&&G(p2))||G(F((p0&&X((p0 U (!p1||G(p0))))))))))'
Support contains 4 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6260 transition count 6091
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6260 transition count 6091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 6260 transition count 6090
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 6256 transition count 6086
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 6256 transition count 6086
Applied a total of 29 rules in 4824 ms. Remains 6256 /6270 variables (removed 14) and now considering 6086/6101 (removed 15) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2024-05-21 14:35:31] [INFO ] Computed 514 invariants in 44 ms
[2024-05-21 14:35:32] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2024-05-21 14:35:32] [INFO ] Invariant cache hit.
[2024-05-21 14:35:33] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2024-05-21 14:35:33] [INFO ] Invariant cache hit.
[2024-05-21 14:35:34] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6270 places, 6086/6101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8020 ms. Remains : 6256/6270 places, 6086/6101 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s2951 1), p0:(EQ s1052 1), p1:(AND (EQ s1830 1) (EQ s4657 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28 reset in 1115 ms.
Product exploration explored 100000 steps with 28 reset in 1135 ms.
Computed a total of 1580 stabilizing places and 1580 stable transitions
Computed a total of 1580 stabilizing places and 1580 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 163 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 14:35:38] [INFO ] Invariant cache hit.
[2024-05-21 14:35:41] [INFO ] [Real]Absence check using 513 positive place invariants in 1323 ms returned sat
[2024-05-21 14:35:41] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 64 ms returned sat
[2024-05-21 14:35:51] [INFO ] After 8025ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-21 14:35:57] [INFO ] Deduced a trap composed of 1109 places in 5750 ms of which 5 ms to minimize.
[2024-05-21 14:36:02] [INFO ] Deduced a trap composed of 1120 places in 5326 ms of which 5 ms to minimize.
[2024-05-21 14:36:10] [INFO ] Deduced a trap composed of 63 places in 7246 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 14:36:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 14:36:10] [INFO ] After 32058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Drop transitions removed 2538 transitions
Trivial Post-agglo rules discarded 2538 transitions
Performed 2538 trivial Post agglomeration. Transition count delta: 2538
Iterating post reduction 0 with 2538 rules applied. Total rules applied 2538 place count 6256 transition count 3548
Reduce places removed 2538 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2826 rules applied. Total rules applied 5364 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5557 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5558 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5558 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 50 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6960 place count 2824 transition count 2558
Performed 1145 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1145 places in 0 ms
Reduce places removed 1145 places and 0 transitions.
Iterating global reduction 4 with 2290 rules applied. Total rules applied 9250 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 286 times.
Iterating global reduction 4 with 286 rules applied. Total rules applied 9536 place count 1679 transition count 983
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 4 with 286 rules applied. Total rules applied 9822 place count 1393 transition count 983
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9823 place count 1392 transition count 982
Reduce places removed 405 places and 0 transitions.
Drop transitions removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 5 with 1050 rules applied. Total rules applied 10873 place count 987 transition count 337
Reduce places removed 645 places and 0 transitions.
Iterating post reduction 6 with 645 rules applied. Total rules applied 11518 place count 342 transition count 337
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 113 Pre rules applied. Total rules applied 11518 place count 342 transition count 224
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 7 with 226 rules applied. Total rules applied 11744 place count 229 transition count 224
Applied a total of 11744 rules in 1409 ms. Remains 229 /6256 variables (removed 6027) and now considering 224/6086 (removed 5862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1410 ms. Remains : 229/6256 places, 224/6086 transitions.
Finished random walk after 5966 steps, including 83 resets, run visited all 6 properties in 224 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p0), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 566 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
[2024-05-21 14:36:13] [INFO ] Invariant cache hit.
[2024-05-21 14:36:23] [INFO ] [Real]Absence check using 513 positive place invariants in 2771 ms returned sat
[2024-05-21 14:36:23] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 54 ms returned sat
[2024-05-21 14:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 14:36:28] [INFO ] [Real]Absence check using state equation in 4708 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Applied a total of 0 rules in 1355 ms. Remains 6256 /6256 variables (removed 0) and now considering 6086/6086 (removed 0) transitions.
[2024-05-21 14:36:29] [INFO ] Invariant cache hit.
[2024-05-21 14:36:30] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2024-05-21 14:36:30] [INFO ] Invariant cache hit.
[2024-05-21 14:36:31] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2024-05-21 14:36:31] [INFO ] Invariant cache hit.
[2024-05-21 14:36:32] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4347 ms. Remains : 6256/6256 places, 6086/6086 transitions.
Computed a total of 1580 stabilizing places and 1580 stable transitions
Computed a total of 1580 stabilizing places and 1580 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 168 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 14:36:34] [INFO ] Invariant cache hit.
[2024-05-21 14:36:37] [INFO ] [Real]Absence check using 513 positive place invariants in 1271 ms returned sat
[2024-05-21 14:36:37] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 64 ms returned sat
[2024-05-21 14:36:46] [INFO ] After 8401ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-21 14:36:53] [INFO ] Deduced a trap composed of 1109 places in 6252 ms of which 4 ms to minimize.
[2024-05-21 14:37:00] [INFO ] Deduced a trap composed of 1120 places in 6379 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 14:37:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 14:37:00] [INFO ] After 25943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Drop transitions removed 2538 transitions
Trivial Post-agglo rules discarded 2538 transitions
Performed 2538 trivial Post agglomeration. Transition count delta: 2538
Iterating post reduction 0 with 2538 rules applied. Total rules applied 2538 place count 6256 transition count 3548
Reduce places removed 2538 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2826 rules applied. Total rules applied 5364 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5557 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5558 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5558 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 50 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6960 place count 2824 transition count 2558
Performed 1145 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1145 places in 0 ms
Reduce places removed 1145 places and 0 transitions.
Iterating global reduction 4 with 2290 rules applied. Total rules applied 9250 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 286 times.
Iterating global reduction 4 with 286 rules applied. Total rules applied 9536 place count 1679 transition count 983
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 4 with 286 rules applied. Total rules applied 9822 place count 1393 transition count 983
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9823 place count 1392 transition count 982
Reduce places removed 405 places and 0 transitions.
Drop transitions removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 5 with 1050 rules applied. Total rules applied 10873 place count 987 transition count 337
Reduce places removed 645 places and 0 transitions.
Iterating post reduction 6 with 645 rules applied. Total rules applied 11518 place count 342 transition count 337
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 113 Pre rules applied. Total rules applied 11518 place count 342 transition count 224
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 7 with 226 rules applied. Total rules applied 11744 place count 229 transition count 224
Applied a total of 11744 rules in 1229 ms. Remains 229 /6256 variables (removed 6027) and now considering 224/6086 (removed 5862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1229 ms. Remains : 229/6256 places, 224/6086 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 229 cols
[2024-05-21 14:37:02] [INFO ] Computed 109 invariants in 2 ms
[2024-05-21 14:37:02] [INFO ] [Real]Absence check using 107 positive place invariants in 21 ms returned sat
[2024-05-21 14:37:02] [INFO ] [Real]Absence check using 107 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-21 14:37:02] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 14:37:02] [INFO ] After 119ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-21 14:37:02] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p0), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 447 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
// Phase 1: matrix 6086 rows 6256 cols
[2024-05-21 14:37:03] [INFO ] Computed 514 invariants in 49 ms
[2024-05-21 14:37:12] [INFO ] [Real]Absence check using 513 positive place invariants in 2401 ms returned sat
[2024-05-21 14:37:12] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 62 ms returned sat
[2024-05-21 14:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 14:37:18] [INFO ] [Real]Absence check using state equation in 5473 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 28 reset in 1092 ms.
Product exploration explored 100000 steps with 29 reset in 1047 ms.
Built C files in :
/tmp/ltsmin10197341929392887361
[2024-05-21 14:37:20] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10197341929392887361
Running compilation step : cd /tmp/ltsmin10197341929392887361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin10197341929392887361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10197341929392887361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Applied a total of 0 rules in 1459 ms. Remains 6256 /6256 variables (removed 0) and now considering 6086/6086 (removed 0) transitions.
[2024-05-21 14:37:25] [INFO ] Invariant cache hit.
[2024-05-21 14:37:26] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2024-05-21 14:37:26] [INFO ] Invariant cache hit.
[2024-05-21 14:37:27] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
[2024-05-21 14:37:27] [INFO ] Invariant cache hit.
[2024-05-21 14:37:28] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4641 ms. Remains : 6256/6256 places, 6086/6086 transitions.
Built C files in :
/tmp/ltsmin16649198983813713340
[2024-05-21 14:37:28] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16649198983813713340
Running compilation step : cd /tmp/ltsmin16649198983813713340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin16649198983813713340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16649198983813713340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:37:32] [INFO ] Flatten gal took : 200 ms
[2024-05-21 14:37:32] [INFO ] Flatten gal took : 200 ms
[2024-05-21 14:37:32] [INFO ] Time to serialize gal into /tmp/LTL16972073895338084807.gal : 47 ms
[2024-05-21 14:37:32] [INFO ] Time to serialize properties into /tmp/LTL9323300013685429092.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16972073895338084807.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4295453039890250902.hoa' '-atoms' '/tmp/LTL9323300013685429092.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9323300013685429092.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4295453039890250902.hoa
Detected timeout of ITS tools.
[2024-05-21 14:37:48] [INFO ] Flatten gal took : 165 ms
[2024-05-21 14:37:48] [INFO ] Flatten gal took : 167 ms
[2024-05-21 14:37:48] [INFO ] Time to serialize gal into /tmp/LTL5197309932225411441.gal : 51 ms
[2024-05-21 14:37:48] [INFO ] Time to serialize properties into /tmp/LTL13381734481425044706.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5197309932225411441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13381734481425044706.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(p1497==1)")&&(X(("(p1497==1)")U((!("((p2814==1)&&(p6198==1))"))||(G("(p1497==1)"))))))))||((X(F(("(p1497==1)")&&(X(("(p14...244
Formula 0 simplified : G(FG(!"(p1497==1)" | X(!"(p1497==1)" M "((p2814==1)&&(p6198==1))")) & (F!"(p4375!=1)" | XG(!"(p1497==1)" | X(!"(p1497==1)" M "((p281...178
Detected timeout of ITS tools.
[2024-05-21 14:38:03] [INFO ] Flatten gal took : 156 ms
[2024-05-21 14:38:03] [INFO ] Applying decomposition
[2024-05-21 14:38:03] [INFO ] Flatten gal took : 162 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16010125263809822406.txt' '-o' '/tmp/graph16010125263809822406.bin' '-w' '/tmp/graph16010125263809822406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16010125263809822406.bin' '-l' '-1' '-v' '-w' '/tmp/graph16010125263809822406.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:38:04] [INFO ] Decomposing Gal with order
[2024-05-21 14:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:38:07] [INFO ] Removed a total of 1109 redundant transitions.
[2024-05-21 14:38:07] [INFO ] Flatten gal took : 590 ms
[2024-05-21 14:38:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 70 ms.
[2024-05-21 14:38:08] [INFO ] Time to serialize gal into /tmp/LTL10564163858119757159.gal : 68 ms
[2024-05-21 14:38:08] [INFO ] Time to serialize properties into /tmp/LTL10306658413280236979.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10564163858119757159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10306658413280236979.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(i23.u452.p1497==1)")&&(X(("(i23.u452.p1497==1)")U((!("((i27.u786.p2814==1)&&(i27.u1964.p6198==1))"))||(G("(i23.u452.p1497...346
Formula 0 simplified : G(FG(!"(i23.u452.p1497==1)" | X(!"(i23.u452.p1497==1)" M "((i27.u786.p2814==1)&&(i27.u1964.p6198==1))")) & (F!"(i41.u1228.p4375!=1)"...262
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8344957616792183964
[2024-05-21 14:38:23] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8344957616792183964
Running compilation step : cd /tmp/ltsmin8344957616792183964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8344957616792183964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8344957616792183964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-96b-LTLFireability-02 finished in 180158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U G(p1))&&X(F(p2))))'
Support contains 3 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6260 transition count 6091
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6260 transition count 6091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 6260 transition count 6090
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 6256 transition count 6086
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 6256 transition count 6086
Applied a total of 29 rules in 4563 ms. Remains 6256 /6270 variables (removed 14) and now considering 6086/6101 (removed 15) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2024-05-21 14:38:31] [INFO ] Computed 514 invariants in 42 ms
[2024-05-21 14:38:31] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-21 14:38:31] [INFO ] Invariant cache hit.
[2024-05-21 14:38:33] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2024-05-21 14:38:33] [INFO ] Invariant cache hit.
[2024-05-21 14:38:34] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6270 places, 6086/6101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7575 ms. Remains : 6256/6270 places, 6086/6101 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s2128 1), p2:(EQ s651 1), p0:(AND (EQ s927 1) (EQ s651 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-03 finished in 8010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 6270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2543 transitions
Trivial Post-agglo rules discarded 2543 transitions
Performed 2543 trivial Post agglomeration. Transition count delta: 2543
Iterating post reduction 0 with 2543 rules applied. Total rules applied 2543 place count 6269 transition count 3557
Reduce places removed 2543 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2832 rules applied. Total rules applied 5375 place count 3726 transition count 3268
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5567 place count 3534 transition count 3268
Performed 704 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 704 Pre rules applied. Total rules applied 5567 place count 3534 transition count 2564
Deduced a syphon composed of 704 places in 66 ms
Reduce places removed 704 places and 0 transitions.
Iterating global reduction 3 with 1408 rules applied. Total rules applied 6975 place count 2830 transition count 2564
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 6981 place count 2824 transition count 2558
Iterating global reduction 3 with 6 rules applied. Total rules applied 6987 place count 2824 transition count 2558
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6987 place count 2824 transition count 2555
Deduced a syphon composed of 3 places in 31 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 6993 place count 2821 transition count 2555
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 3 with 2286 rules applied. Total rules applied 9279 place count 1678 transition count 1268
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9280 place count 1677 transition count 1267
Reduce places removed 190 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 3 with 284 rules applied. Total rules applied 9564 place count 1487 transition count 1173
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 4 with 94 rules applied. Total rules applied 9658 place count 1393 transition count 1173
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9658 place count 1393 transition count 1077
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9850 place count 1297 transition count 1077
Applied a total of 9850 rules in 1570 ms. Remains 1297 /6270 variables (removed 4973) and now considering 1077/6101 (removed 5024) transitions.
// Phase 1: matrix 1077 rows 1297 cols
[2024-05-21 14:38:36] [INFO ] Computed 324 invariants in 11 ms
[2024-05-21 14:38:37] [INFO ] Implicit Places using invariants in 1724 ms returned [509, 583, 657, 695, 733, 807, 881, 919, 957, 961, 965, 969, 973, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1178, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1211, 1215, 1219, 1223, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1283, 1287, 1291, 1296]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1727 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1192/6270 places, 1077/6101 transitions.
Graph (trivial) has 496 edges and 1192 vertex of which 25 / 1192 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1089 transition count 951
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1089 transition count 951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1085 transition count 947
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1085 transition count 947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1081 transition count 943
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1081 transition count 943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1077 transition count 939
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1077 transition count 939
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1073 transition count 935
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1073 transition count 935
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1069 transition count 931
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1069 transition count 931
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1065 transition count 927
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1065 transition count 927
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1061 transition count 923
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1061 transition count 923
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1057 transition count 919
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1057 transition count 919
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1053 transition count 915
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1053 transition count 915
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1049 transition count 911
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1049 transition count 911
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1045 transition count 907
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1045 transition count 907
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1041 transition count 903
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1041 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1039 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1039 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1037 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1037 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1035 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1035 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1033 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1033 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1031 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1031 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1029 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1029 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1027 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1027 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1025 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1025 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1023 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1023 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1021 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1021 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1019 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1019 transition count 881
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1017 transition count 879
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1017 transition count 879
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1016 transition count 878
Applied a total of 305 rules in 1129 ms. Remains 1016 /1192 variables (removed 176) and now considering 878/1077 (removed 199) transitions.
// Phase 1: matrix 878 rows 1016 cols
[2024-05-21 14:38:38] [INFO ] Computed 219 invariants in 14 ms
[2024-05-21 14:38:39] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2024-05-21 14:38:39] [INFO ] Invariant cache hit.
[2024-05-21 14:38:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:38:42] [INFO ] Implicit Places using invariants and state equation in 2648 ms returned []
Implicit Place search using SMT with State Equation took 3717 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1016/6270 places, 878/6101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8144 ms. Remains : 1016/6270 places, 878/6101 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s26 1)], 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 447 reset in 1548 ms.
Product exploration explored 100000 steps with 447 reset in 1762 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 247420 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247420 steps, saw 90739 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:38:49] [INFO ] Invariant cache hit.
[2024-05-21 14:38:50] [INFO ] [Real]Absence check using 219 positive place invariants in 86 ms returned sat
[2024-05-21 14:38:50] [INFO ] After 705ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 14:38:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:38:51] [INFO ] After 61ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:38:51] [INFO ] After 1068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:38:51] [INFO ] [Nat]Absence check using 219 positive place invariants in 71 ms returned sat
[2024-05-21 14:38:51] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:38:51] [INFO ] After 47ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:38:52] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-21 14:38:52] [INFO ] After 1106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 878/878 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1016 transition count 877
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 369 place count 1016 transition count 509
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t636.t1247 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 499 edges and 432 vertex of which 304 / 432 are part of one of the 1 SCC in 1 ms
Free SCC test removed 303 places
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 1 with 116 rules applied. Total rules applied 485 place count 129 transition count 394
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 2 with 491 rules applied. Total rules applied 976 place count 16 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 976 place count 16 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 980 place count 14 transition count 14
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 983 place count 11 transition count 11
Iterating global reduction 3 with 3 rules applied. Total rules applied 986 place count 11 transition count 11
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 987 place count 10 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 988 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 989 place count 9 transition count 9
Iterating global reduction 3 with 1 rules applied. Total rules applied 990 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 992 place count 8 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 994 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 995 place count 6 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 997 place count 6 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 999 place count 4 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1000 place count 4 transition count 3
Applied a total of 1000 rules in 133 ms. Remains 4 /1016 variables (removed 1012) and now considering 3/878 (removed 875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 4/1016 places, 3/878 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1016 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1016/1016 places, 878/878 transitions.
Applied a total of 0 rules in 64 ms. Remains 1016 /1016 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2024-05-21 14:38:52] [INFO ] Invariant cache hit.
[2024-05-21 14:38:53] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-05-21 14:38:53] [INFO ] Invariant cache hit.
[2024-05-21 14:38:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:38:56] [INFO ] Implicit Places using invariants and state equation in 2330 ms returned []
Implicit Place search using SMT with State Equation took 3436 ms to find 0 implicit places.
[2024-05-21 14:38:56] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-21 14:38:56] [INFO ] Invariant cache hit.
[2024-05-21 14:38:57] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4677 ms. Remains : 1016/1016 places, 878/878 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 45 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246290 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246290 steps, saw 90618 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:39:01] [INFO ] Invariant cache hit.
[2024-05-21 14:39:01] [INFO ] [Real]Absence check using 219 positive place invariants in 57 ms returned sat
[2024-05-21 14:39:02] [INFO ] After 541ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 14:39:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:39:02] [INFO ] After 52ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:39:02] [INFO ] After 840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:39:02] [INFO ] [Nat]Absence check using 219 positive place invariants in 70 ms returned sat
[2024-05-21 14:39:03] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:39:03] [INFO ] After 53ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:39:03] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-21 14:39:03] [INFO ] After 1111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 878/878 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1016 transition count 877
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 369 place count 1016 transition count 509
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t636.t1247 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 499 edges and 432 vertex of which 304 / 432 are part of one of the 1 SCC in 1 ms
Free SCC test removed 303 places
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 1 with 116 rules applied. Total rules applied 485 place count 129 transition count 394
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 2 with 491 rules applied. Total rules applied 976 place count 16 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 976 place count 16 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 980 place count 14 transition count 14
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 983 place count 11 transition count 11
Iterating global reduction 3 with 3 rules applied. Total rules applied 986 place count 11 transition count 11
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 987 place count 10 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 988 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 989 place count 9 transition count 9
Iterating global reduction 3 with 1 rules applied. Total rules applied 990 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 992 place count 8 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 994 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 995 place count 6 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 997 place count 6 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 999 place count 4 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1000 place count 4 transition count 3
Applied a total of 1000 rules in 118 ms. Remains 4 /1016 variables (removed 1012) and now considering 3/878 (removed 875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 4/1016 places, 3/878 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 446 reset in 1885 ms.
Product exploration explored 100000 steps with 445 reset in 1659 ms.
Built C files in :
/tmp/ltsmin4135971825903028201
[2024-05-21 14:39:07] [INFO ] Computing symmetric may disable matrix : 878 transitions.
[2024-05-21 14:39:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:39:07] [INFO ] Computing symmetric may enable matrix : 878 transitions.
[2024-05-21 14:39:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:39:07] [INFO ] Computing Do-Not-Accords matrix : 878 transitions.
[2024-05-21 14:39:07] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:39:07] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4135971825903028201
Running compilation step : cd /tmp/ltsmin4135971825903028201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin4135971825903028201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4135971825903028201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1016 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1016/1016 places, 878/878 transitions.
Applied a total of 0 rules in 42 ms. Remains 1016 /1016 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2024-05-21 14:39:10] [INFO ] Invariant cache hit.
[2024-05-21 14:39:11] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2024-05-21 14:39:11] [INFO ] Invariant cache hit.
[2024-05-21 14:39:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:39:14] [INFO ] Implicit Places using invariants and state equation in 2059 ms returned []
Implicit Place search using SMT with State Equation took 3112 ms to find 0 implicit places.
[2024-05-21 14:39:14] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-21 14:39:14] [INFO ] Invariant cache hit.
[2024-05-21 14:39:15] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4289 ms. Remains : 1016/1016 places, 878/878 transitions.
Built C files in :
/tmp/ltsmin9750324954209169812
[2024-05-21 14:39:15] [INFO ] Computing symmetric may disable matrix : 878 transitions.
[2024-05-21 14:39:15] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:39:15] [INFO ] Computing symmetric may enable matrix : 878 transitions.
[2024-05-21 14:39:15] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:39:15] [INFO ] Computing Do-Not-Accords matrix : 878 transitions.
[2024-05-21 14:39:15] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:39:15] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9750324954209169812
Running compilation step : cd /tmp/ltsmin9750324954209169812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9750324954209169812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9750324954209169812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:39:18] [INFO ] Flatten gal took : 31 ms
[2024-05-21 14:39:18] [INFO ] Flatten gal took : 27 ms
[2024-05-21 14:39:18] [INFO ] Time to serialize gal into /tmp/LTL9668760388051935852.gal : 5 ms
[2024-05-21 14:39:18] [INFO ] Time to serialize properties into /tmp/LTL17722138860478065758.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9668760388051935852.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17273512385660171166.hoa' '-atoms' '/tmp/LTL17722138860478065758.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17722138860478065758.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17273512385660171166.hoa
Detected timeout of ITS tools.
[2024-05-21 14:39:33] [INFO ] Flatten gal took : 22 ms
[2024-05-21 14:39:33] [INFO ] Flatten gal took : 20 ms
[2024-05-21 14:39:33] [INFO ] Time to serialize gal into /tmp/LTL11892860072707962101.gal : 8 ms
[2024-05-21 14:39:33] [INFO ] Time to serialize properties into /tmp/LTL10296106547522679274.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11892860072707962101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10296106547522679274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p551!=1)"))))
Formula 0 simplified : FG!"(p551!=1)"
Detected timeout of ITS tools.
[2024-05-21 14:39:48] [INFO ] Flatten gal took : 23 ms
[2024-05-21 14:39:48] [INFO ] Applying decomposition
[2024-05-21 14:39:48] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12054909444612019152.txt' '-o' '/tmp/graph12054909444612019152.bin' '-w' '/tmp/graph12054909444612019152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12054909444612019152.bin' '-l' '-1' '-v' '-w' '/tmp/graph12054909444612019152.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:39:48] [INFO ] Decomposing Gal with order
[2024-05-21 14:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:39:48] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 14:39:49] [INFO ] Flatten gal took : 66 ms
[2024-05-21 14:39:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 14:39:49] [INFO ] Time to serialize gal into /tmp/LTL13843389825240377334.gal : 17 ms
[2024-05-21 14:39:49] [INFO ] Time to serialize properties into /tmp/LTL15542045114812184230.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13843389825240377334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15542045114812184230.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i3.i0.i2.u11.p551!=1)"))))
Formula 0 simplified : FG!"(i3.i0.i2.u11.p551!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9419230885087473115
[2024-05-21 14:40:04] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9419230885087473115
Running compilation step : cd /tmp/ltsmin9419230885087473115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2503 ms.
Running link step : cd /tmp/ltsmin9419230885087473115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 186 ms.
Running LTSmin : cd /tmp/ltsmin9419230885087473115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLFireability-04 finished in 104740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 6270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2543 transitions
Trivial Post-agglo rules discarded 2543 transitions
Performed 2543 trivial Post agglomeration. Transition count delta: 2543
Iterating post reduction 0 with 2543 rules applied. Total rules applied 2543 place count 6269 transition count 3557
Reduce places removed 2543 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2832 rules applied. Total rules applied 5375 place count 3726 transition count 3268
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5567 place count 3534 transition count 3268
Performed 704 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 704 Pre rules applied. Total rules applied 5567 place count 3534 transition count 2564
Deduced a syphon composed of 704 places in 38 ms
Reduce places removed 704 places and 0 transitions.
Iterating global reduction 3 with 1408 rules applied. Total rules applied 6975 place count 2830 transition count 2564
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 6982 place count 2823 transition count 2557
Iterating global reduction 3 with 7 rules applied. Total rules applied 6989 place count 2823 transition count 2557
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6989 place count 2823 transition count 2553
Deduced a syphon composed of 4 places in 39 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 6997 place count 2819 transition count 2553
Performed 1141 Post agglomeration using F-continuation condition with reduction of 143 identical transitions.
Deduced a syphon composed of 1141 places in 1 ms
Reduce places removed 1141 places and 0 transitions.
Iterating global reduction 3 with 2282 rules applied. Total rules applied 9279 place count 1678 transition count 1269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9280 place count 1678 transition count 1268
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9281 place count 1677 transition count 1267
Reduce places removed 190 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 4 with 284 rules applied. Total rules applied 9565 place count 1487 transition count 1173
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 9659 place count 1393 transition count 1173
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9659 place count 1393 transition count 1077
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9851 place count 1297 transition count 1077
Applied a total of 9851 rules in 1351 ms. Remains 1297 /6270 variables (removed 4973) and now considering 1077/6101 (removed 5024) transitions.
// Phase 1: matrix 1077 rows 1297 cols
[2024-05-21 14:40:20] [INFO ] Computed 324 invariants in 5 ms
[2024-05-21 14:40:22] [INFO ] Implicit Places using invariants in 1664 ms returned [509, 583, 657, 695, 733, 807, 881, 919, 957, 961, 965, 969, 973, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1178, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1211, 1215, 1219, 1223, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1283, 1287, 1291, 1296]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1666 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1192/6270 places, 1077/6101 transitions.
Graph (trivial) has 496 edges and 1192 vertex of which 25 / 1192 are part of one of the 1 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1089 transition count 951
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1089 transition count 951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1085 transition count 947
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1085 transition count 947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1081 transition count 943
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1081 transition count 943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1077 transition count 939
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1077 transition count 939
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1073 transition count 935
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1073 transition count 935
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1069 transition count 931
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1069 transition count 931
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1065 transition count 927
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1065 transition count 927
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1061 transition count 923
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1061 transition count 923
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1057 transition count 919
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1057 transition count 919
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1053 transition count 915
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1053 transition count 915
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1049 transition count 911
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1049 transition count 911
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1045 transition count 907
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1045 transition count 907
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1041 transition count 903
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1041 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1039 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1039 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1037 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1037 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1035 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1035 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1033 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1033 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1031 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1031 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1029 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1029 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1027 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1027 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1025 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1025 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1023 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1023 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1021 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1021 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1019 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1019 transition count 881
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1017 transition count 879
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1017 transition count 879
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1016 transition count 878
Applied a total of 305 rules in 1153 ms. Remains 1016 /1192 variables (removed 176) and now considering 878/1077 (removed 199) transitions.
// Phase 1: matrix 878 rows 1016 cols
[2024-05-21 14:40:23] [INFO ] Computed 219 invariants in 8 ms
[2024-05-21 14:40:24] [INFO ] Implicit Places using invariants in 1212 ms returned []
[2024-05-21 14:40:24] [INFO ] Invariant cache hit.
[2024-05-21 14:40:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:40:26] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 3170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1016/6270 places, 878/6101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7343 ms. Remains : 1016/6270 places, 878/6101 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-05 finished in 7438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 6270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2540 transitions
Trivial Post-agglo rules discarded 2540 transitions
Performed 2540 trivial Post agglomeration. Transition count delta: 2540
Iterating post reduction 0 with 2540 rules applied. Total rules applied 2540 place count 6269 transition count 3560
Reduce places removed 2540 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2829 rules applied. Total rules applied 5369 place count 3729 transition count 3271
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5562 place count 3537 transition count 3270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5563 place count 3536 transition count 3270
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5563 place count 3536 transition count 2568
Deduced a syphon composed of 702 places in 36 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6967 place count 2834 transition count 2568
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 6974 place count 2827 transition count 2561
Iterating global reduction 4 with 7 rules applied. Total rules applied 6981 place count 2827 transition count 2561
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6981 place count 2827 transition count 2557
Deduced a syphon composed of 4 places in 42 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6989 place count 2823 transition count 2557
Performed 1142 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1142 places in 1 ms
Reduce places removed 1142 places and 0 transitions.
Iterating global reduction 4 with 2284 rules applied. Total rules applied 9273 place count 1681 transition count 1271
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9274 place count 1680 transition count 1270
Reduce places removed 190 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 4 with 284 rules applied. Total rules applied 9558 place count 1490 transition count 1176
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 9652 place count 1396 transition count 1176
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9652 place count 1396 transition count 1080
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9844 place count 1300 transition count 1080
Applied a total of 9844 rules in 1326 ms. Remains 1300 /6270 variables (removed 4970) and now considering 1080/6101 (removed 5021) transitions.
// Phase 1: matrix 1080 rows 1300 cols
[2024-05-21 14:40:27] [INFO ] Computed 324 invariants in 6 ms
[2024-05-21 14:40:29] [INFO ] Implicit Places using invariants in 1812 ms returned [508, 582, 656, 694, 732, 806, 880, 920, 958, 962, 966, 970, 974, 979, 983, 987, 991, 995, 999, 1003, 1007, 1011, 1015, 1019, 1023, 1027, 1031, 1035, 1039, 1043, 1048, 1052, 1056, 1060, 1064, 1068, 1072, 1076, 1080, 1084, 1088, 1092, 1096, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1180, 1184, 1188, 1192, 1196, 1200, 1204, 1208, 1213, 1217, 1221, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1293]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1814 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1196/6270 places, 1080/6101 transitions.
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 102 place count 1094 transition count 978
Iterating global reduction 0 with 102 rules applied. Total rules applied 204 place count 1094 transition count 978
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 227 place count 1094 transition count 955
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 230 place count 1091 transition count 952
Iterating global reduction 1 with 3 rules applied. Total rules applied 233 place count 1091 transition count 952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 236 place count 1088 transition count 949
Iterating global reduction 1 with 3 rules applied. Total rules applied 239 place count 1088 transition count 949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 242 place count 1085 transition count 946
Iterating global reduction 1 with 3 rules applied. Total rules applied 245 place count 1085 transition count 946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 248 place count 1082 transition count 943
Iterating global reduction 1 with 3 rules applied. Total rules applied 251 place count 1082 transition count 943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 254 place count 1079 transition count 940
Iterating global reduction 1 with 3 rules applied. Total rules applied 257 place count 1079 transition count 940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 260 place count 1076 transition count 937
Iterating global reduction 1 with 3 rules applied. Total rules applied 263 place count 1076 transition count 937
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 266 place count 1073 transition count 934
Iterating global reduction 1 with 3 rules applied. Total rules applied 269 place count 1073 transition count 934
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 272 place count 1070 transition count 931
Iterating global reduction 1 with 3 rules applied. Total rules applied 275 place count 1070 transition count 931
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 278 place count 1067 transition count 928
Iterating global reduction 1 with 3 rules applied. Total rules applied 281 place count 1067 transition count 928
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 284 place count 1064 transition count 925
Iterating global reduction 1 with 3 rules applied. Total rules applied 287 place count 1064 transition count 925
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 290 place count 1061 transition count 922
Iterating global reduction 1 with 3 rules applied. Total rules applied 293 place count 1061 transition count 922
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 296 place count 1058 transition count 919
Iterating global reduction 1 with 3 rules applied. Total rules applied 299 place count 1058 transition count 919
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 301 place count 1056 transition count 917
Iterating global reduction 1 with 2 rules applied. Total rules applied 303 place count 1056 transition count 917
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 305 place count 1054 transition count 915
Iterating global reduction 1 with 2 rules applied. Total rules applied 307 place count 1054 transition count 915
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 309 place count 1052 transition count 913
Iterating global reduction 1 with 2 rules applied. Total rules applied 311 place count 1052 transition count 913
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 313 place count 1050 transition count 911
Iterating global reduction 1 with 2 rules applied. Total rules applied 315 place count 1050 transition count 911
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 317 place count 1048 transition count 909
Iterating global reduction 1 with 2 rules applied. Total rules applied 319 place count 1048 transition count 909
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 321 place count 1046 transition count 907
Iterating global reduction 1 with 2 rules applied. Total rules applied 323 place count 1046 transition count 907
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 325 place count 1044 transition count 905
Iterating global reduction 1 with 2 rules applied. Total rules applied 327 place count 1044 transition count 905
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 329 place count 1042 transition count 903
Iterating global reduction 1 with 2 rules applied. Total rules applied 331 place count 1042 transition count 903
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 333 place count 1040 transition count 901
Iterating global reduction 1 with 2 rules applied. Total rules applied 335 place count 1040 transition count 901
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 337 place count 1038 transition count 899
Iterating global reduction 1 with 2 rules applied. Total rules applied 339 place count 1038 transition count 899
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 341 place count 1036 transition count 897
Iterating global reduction 1 with 2 rules applied. Total rules applied 343 place count 1036 transition count 897
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 345 place count 1034 transition count 895
Iterating global reduction 1 with 2 rules applied. Total rules applied 347 place count 1034 transition count 895
Applied a total of 347 rules in 905 ms. Remains 1034 /1196 variables (removed 162) and now considering 895/1080 (removed 185) transitions.
// Phase 1: matrix 895 rows 1034 cols
[2024-05-21 14:40:30] [INFO ] Computed 220 invariants in 5 ms
[2024-05-21 14:40:31] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-21 14:40:31] [INFO ] Invariant cache hit.
[2024-05-21 14:40:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:40:33] [INFO ] Implicit Places using invariants and state equation in 2055 ms returned []
Implicit Place search using SMT with State Equation took 2997 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1034/6270 places, 895/6101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7044 ms. Remains : 1034/6270 places, 895/6101 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s926 1) (EQ s1032 1)), p0:(EQ s821 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 247 steps with 0 reset in 7 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-07 finished in 7280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Support contains 2 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6261 transition count 6092
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6261 transition count 6092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 6261 transition count 6091
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 6256 transition count 6086
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 6256 transition count 6086
Applied a total of 29 rules in 4678 ms. Remains 6256 /6270 variables (removed 14) and now considering 6086/6101 (removed 15) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2024-05-21 14:40:38] [INFO ] Computed 514 invariants in 45 ms
[2024-05-21 14:40:39] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-21 14:40:39] [INFO ] Invariant cache hit.
[2024-05-21 14:40:40] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
[2024-05-21 14:40:40] [INFO ] Invariant cache hit.
[2024-05-21 14:40:41] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6270 places, 6086/6101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7524 ms. Remains : 6256/6270 places, 6086/6101 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s4924 1), p0:(OR (EQ s2732 0) (EQ s4924 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3705 steps with 0 reset in 45 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-08 finished in 7925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&X(X(X(G(p0))))))||X(F(p1)))))'
Support contains 2 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6260 transition count 6091
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6260 transition count 6091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 6260 transition count 6090
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 6255 transition count 6085
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 6255 transition count 6085
Applied a total of 31 rules in 4784 ms. Remains 6255 /6270 variables (removed 15) and now considering 6085/6101 (removed 16) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2024-05-21 14:40:46] [INFO ] Computed 514 invariants in 43 ms
[2024-05-21 14:40:47] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-05-21 14:40:47] [INFO ] Invariant cache hit.
[2024-05-21 14:40:48] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2024-05-21 14:40:48] [INFO ] Invariant cache hit.
[2024-05-21 14:40:49] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6270 places, 6085/6101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7929 ms. Remains : 6255/6270 places, 6085/6101 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1850 0), p1:(EQ s5320 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 117 reset in 709 ms.
Product exploration explored 100000 steps with 116 reset in 880 ms.
Computed a total of 1579 stabilizing places and 1579 stable transitions
Computed a total of 1579 stabilizing places and 1579 stable transitions
Detected a total of 1579/6255 stabilizing places and 1579/6085 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT 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 230 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2455 steps, including 0 resets, run visited all 3 properties in 42 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 481 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 6255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6255/6255 places, 6085/6085 transitions.
Applied a total of 0 rules in 1746 ms. Remains 6255 /6255 variables (removed 0) and now considering 6085/6085 (removed 0) transitions.
[2024-05-21 14:40:55] [INFO ] Invariant cache hit.
[2024-05-21 14:40:56] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-21 14:40:56] [INFO ] Invariant cache hit.
[2024-05-21 14:40:57] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
[2024-05-21 14:40:57] [INFO ] Invariant cache hit.
[2024-05-21 14:40:58] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4656 ms. Remains : 6255/6255 places, 6085/6085 transitions.
Computed a total of 1579 stabilizing places and 1579 stable transitions
Computed a total of 1579 stabilizing places and 1579 stable transitions
Detected a total of 1579/6255 stabilizing places and 1579/6085 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2476 steps, including 0 resets, run visited all 3 properties in 60 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 427 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 117 reset in 654 ms.
Product exploration explored 100000 steps with 117 reset in 845 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 6255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6255/6255 places, 6085/6085 transitions.
Performed 2276 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2276 rules applied. Total rules applied 2276 place count 6255 transition count 6085
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 192 rules applied. Total rules applied 2468 place count 6255 transition count 5989
Performed 845 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 845 Pre rules applied. Total rules applied 2468 place count 6255 transition count 5989
Deduced a syphon composed of 3217 places in 77 ms
Iterating global reduction 2 with 845 rules applied. Total rules applied 3313 place count 6255 transition count 5989
Discarding 2099 places :
Symmetric choice reduction at 2 with 2099 rule applications. Total rules 5412 place count 4156 transition count 3890
Deduced a syphon composed of 1118 places in 57 ms
Iterating global reduction 2 with 2099 rules applied. Total rules applied 7511 place count 4156 transition count 3890
Performed 1359 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 2477 places in 2 ms
Iterating global reduction 2 with 1359 rules applied. Total rules applied 8870 place count 4156 transition count 3746
Renaming transitions due to excessive name length > 1024 char.
Discarding 847 places :
Symmetric choice reduction at 2 with 847 rule applications. Total rules 9717 place count 3309 transition count 2899
Deduced a syphon composed of 1630 places in 1 ms
Iterating global reduction 2 with 847 rules applied. Total rules applied 10564 place count 3309 transition count 2899
Deduced a syphon composed of 1630 places in 1 ms
Applied a total of 10564 rules in 6929 ms. Remains 3309 /6255 variables (removed 2946) and now considering 2899/6085 (removed 3186) transitions.
[2024-05-21 14:41:09] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 2899 rows 3309 cols
[2024-05-21 14:41:10] [INFO ] Computed 514 invariants in 457 ms
[2024-05-21 14:41:13] [INFO ] Dead Transitions using invariants and state equation in 3954 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3309/6255 places, 2899/6085 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10994 ms. Remains : 3309/6255 places, 2899/6085 transitions.
Built C files in :
/tmp/ltsmin639253480817980796
[2024-05-21 14:41:13] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin639253480817980796
Running compilation step : cd /tmp/ltsmin639253480817980796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin639253480817980796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin639253480817980796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 6255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6255/6255 places, 6085/6085 transitions.
Applied a total of 0 rules in 1373 ms. Remains 6255 /6255 variables (removed 0) and now considering 6085/6085 (removed 0) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2024-05-21 14:41:18] [INFO ] Computed 514 invariants in 40 ms
[2024-05-21 14:41:19] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-21 14:41:19] [INFO ] Invariant cache hit.
[2024-05-21 14:41:20] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2024-05-21 14:41:20] [INFO ] Invariant cache hit.
[2024-05-21 14:41:21] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4147 ms. Remains : 6255/6255 places, 6085/6085 transitions.
Built C files in :
/tmp/ltsmin11646564769784037544
[2024-05-21 14:41:21] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11646564769784037544
Running compilation step : cd /tmp/ltsmin11646564769784037544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11646564769784037544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11646564769784037544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:41:24] [INFO ] Flatten gal took : 122 ms
[2024-05-21 14:41:24] [INFO ] Flatten gal took : 153 ms
[2024-05-21 14:41:24] [INFO ] Time to serialize gal into /tmp/LTL7475945466623619126.gal : 47 ms
[2024-05-21 14:41:24] [INFO ] Time to serialize properties into /tmp/LTL4120284789861664181.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7475945466623619126.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13643334191704018428.hoa' '-atoms' '/tmp/LTL4120284789861664181.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4120284789861664181.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13643334191704018428.hoa
Detected timeout of ITS tools.
[2024-05-21 14:41:40] [INFO ] Flatten gal took : 131 ms
[2024-05-21 14:41:40] [INFO ] Flatten gal took : 205 ms
[2024-05-21 14:41:40] [INFO ] Time to serialize gal into /tmp/LTL4578201921854485061.gal : 34 ms
[2024-05-21 14:41:40] [INFO ] Time to serialize properties into /tmp/LTL199682144601315206.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4578201921854485061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL199682144601315206.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((G(("(p2850==0)")&&(X(X(X(G("(p2850==0)")))))))||(X(F("(p6901==1)"))))))
Formula 0 simplified : X(F(!"(p2850==0)" | XXXF!"(p2850==0)") & XG!"(p6901==1)")
Detected timeout of ITS tools.
[2024-05-21 14:41:55] [INFO ] Flatten gal took : 129 ms
[2024-05-21 14:41:55] [INFO ] Applying decomposition
[2024-05-21 14:41:55] [INFO ] Flatten gal took : 175 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6533136372506652862.txt' '-o' '/tmp/graph6533136372506652862.bin' '-w' '/tmp/graph6533136372506652862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6533136372506652862.bin' '-l' '-1' '-v' '-w' '/tmp/graph6533136372506652862.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:41:56] [INFO ] Decomposing Gal with order
[2024-05-21 14:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:41:58] [INFO ] Removed a total of 1118 redundant transitions.
[2024-05-21 14:41:58] [INFO ] Flatten gal took : 289 ms
[2024-05-21 14:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2024-05-21 14:41:59] [INFO ] Time to serialize gal into /tmp/LTL3602789538111939248.gal : 46 ms
[2024-05-21 14:41:59] [INFO ] Time to serialize properties into /tmp/LTL664207992472487908.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3602789538111939248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL664207992472487908.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((G(("(i30.u806.p2850==0)")&&(X(X(X(G("(i30.u806.p2850==0)")))))))||(X(F("(i47.u2261.p6901==1)"))))))
Formula 0 simplified : X(F(!"(i30.u806.p2850==0)" | XXXF!"(i30.u806.p2850==0)") & XG!"(i47.u2261.p6901==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5482515442017892295
[2024-05-21 14:42:14] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5482515442017892295
Running compilation step : cd /tmp/ltsmin5482515442017892295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin5482515442017892295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5482515442017892295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-96b-LTLFireability-09 finished in 95377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 3 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6260 transition count 6091
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6260 transition count 6091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 6260 transition count 6090
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 6256 transition count 6086
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 6256 transition count 6086
Applied a total of 29 rules in 3767 ms. Remains 6256 /6270 variables (removed 14) and now considering 6086/6101 (removed 15) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2024-05-21 14:42:21] [INFO ] Computed 514 invariants in 43 ms
[2024-05-21 14:42:21] [INFO ] Implicit Places using invariants in 942 ms returned []
[2024-05-21 14:42:21] [INFO ] Invariant cache hit.
[2024-05-21 14:42:23] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2024-05-21 14:42:23] [INFO ] Invariant cache hit.
[2024-05-21 14:42:24] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6270 places, 6086/6101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6819 ms. Remains : 6256/6270 places, 6086/6101 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s1857 1), p0:(OR (EQ s1586 0) (EQ s3735 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5767 ms.
Product exploration explored 100000 steps with 50000 reset in 6111 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96b-LTLFireability-12 finished in 19388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(G(p1))))))'
Support contains 3 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6260 transition count 6091
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6260 transition count 6091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 6260 transition count 6090
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 6255 transition count 6085
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 6255 transition count 6085
Applied a total of 31 rules in 3821 ms. Remains 6255 /6270 variables (removed 15) and now considering 6085/6101 (removed 16) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2024-05-21 14:42:40] [INFO ] Computed 514 invariants in 46 ms
[2024-05-21 14:42:41] [INFO ] Implicit Places using invariants in 1239 ms returned []
[2024-05-21 14:42:41] [INFO ] Invariant cache hit.
[2024-05-21 14:42:42] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 2395 ms to find 0 implicit places.
[2024-05-21 14:42:42] [INFO ] Invariant cache hit.
[2024-05-21 14:42:43] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6270 places, 6085/6101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7271 ms. Remains : 6255/6270 places, 6085/6101 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s1530 1), p1:(OR (EQ s2865 1) (EQ s6166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3698 steps with 0 reset in 57 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-13 finished in 7626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 6270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2541 transitions
Trivial Post-agglo rules discarded 2541 transitions
Performed 2541 trivial Post agglomeration. Transition count delta: 2541
Iterating post reduction 0 with 2541 rules applied. Total rules applied 2541 place count 6269 transition count 3559
Reduce places removed 2541 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 2829 rules applied. Total rules applied 5370 place count 3728 transition count 3271
Reduce places removed 191 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 192 rules applied. Total rules applied 5562 place count 3537 transition count 3270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5563 place count 3536 transition count 3270
Performed 704 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 704 Pre rules applied. Total rules applied 5563 place count 3536 transition count 2566
Deduced a syphon composed of 704 places in 63 ms
Reduce places removed 704 places and 0 transitions.
Iterating global reduction 4 with 1408 rules applied. Total rules applied 6971 place count 2832 transition count 2566
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 6978 place count 2825 transition count 2559
Iterating global reduction 4 with 7 rules applied. Total rules applied 6985 place count 2825 transition count 2559
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6985 place count 2825 transition count 2555
Deduced a syphon composed of 4 places in 38 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6993 place count 2821 transition count 2555
Performed 1142 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1142 places in 1 ms
Reduce places removed 1142 places and 0 transitions.
Iterating global reduction 4 with 2284 rules applied. Total rules applied 9277 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9278 place count 1678 transition count 1268
Reduce places removed 189 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 4 with 282 rules applied. Total rules applied 9560 place count 1489 transition count 1175
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 5 with 93 rules applied. Total rules applied 9653 place count 1396 transition count 1175
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9653 place count 1396 transition count 1079
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9845 place count 1300 transition count 1079
Applied a total of 9845 rules in 1508 ms. Remains 1300 /6270 variables (removed 4970) and now considering 1079/6101 (removed 5022) transitions.
// Phase 1: matrix 1079 rows 1300 cols
[2024-05-21 14:42:45] [INFO ] Computed 325 invariants in 5 ms
[2024-05-21 14:42:47] [INFO ] Implicit Places using invariants in 1413 ms returned [511, 585, 659, 697, 735, 809, 883, 921, 959, 963, 967, 971, 975, 980, 984, 988, 992, 996, 1000, 1004, 1008, 1012, 1016, 1020, 1024, 1028, 1033, 1037, 1041, 1045, 1049, 1053, 1057, 1061, 1065, 1069, 1073, 1077, 1081, 1085, 1089, 1093, 1097, 1101, 1105, 1109, 1113, 1117, 1121, 1125, 1129, 1133, 1137, 1141, 1145, 1149, 1153, 1155, 1157, 1159, 1161, 1163, 1165, 1167, 1169, 1171, 1173, 1175, 1177, 1181, 1185, 1189, 1193, 1197, 1201, 1205, 1209, 1214, 1218, 1222, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1250, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1294, 1299]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1419 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1195/6270 places, 1079/6101 transitions.
Graph (trivial) has 496 edges and 1195 vertex of which 25 / 1195 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1092 transition count 953
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1092 transition count 953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1088 transition count 949
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1088 transition count 949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1084 transition count 945
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1084 transition count 945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1080 transition count 941
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1080 transition count 941
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1076 transition count 937
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1076 transition count 937
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1072 transition count 933
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1072 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1068 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1068 transition count 929
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1064 transition count 925
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1064 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1060 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1060 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1056 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1056 transition count 917
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1052 transition count 913
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1052 transition count 913
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1048 transition count 909
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1048 transition count 909
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1044 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1044 transition count 905
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1042 transition count 903
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1042 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1040 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1040 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1038 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1038 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1036 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1036 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1034 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1034 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1032 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1032 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1030 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1030 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1028 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1028 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1026 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1026 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1024 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1024 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1022 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1022 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1020 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1020 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1019 transition count 880
Applied a total of 305 rules in 940 ms. Remains 1019 /1195 variables (removed 176) and now considering 880/1079 (removed 199) transitions.
// Phase 1: matrix 880 rows 1019 cols
[2024-05-21 14:42:48] [INFO ] Computed 220 invariants in 4 ms
[2024-05-21 14:42:49] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-05-21 14:42:49] [INFO ] Invariant cache hit.
[2024-05-21 14:42:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:42:51] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 3068 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1019/6270 places, 880/6101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6936 ms. Remains : 1019/6270 places, 880/6101 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s508 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-15 finished in 6993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(F((p0&&X((p0 U (!p1||G(p0)))))))&&G(p2))||G(F((p0&&X((p0 U (!p1||G(p0))))))))))'
Found a Shortening insensitive property : AutoFlight-PT-96b-LTLFireability-02
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Support contains 4 out of 6270 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6270/6270 places, 6101/6101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2539 transitions
Trivial Post-agglo rules discarded 2539 transitions
Performed 2539 trivial Post agglomeration. Transition count delta: 2539
Iterating post reduction 0 with 2539 rules applied. Total rules applied 2539 place count 6269 transition count 3561
Reduce places removed 2539 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2828 rules applied. Total rules applied 5367 place count 3730 transition count 3272
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5560 place count 3538 transition count 3271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5561 place count 3537 transition count 3271
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5561 place count 3537 transition count 2568
Deduced a syphon composed of 703 places in 61 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6967 place count 2834 transition count 2568
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 6974 place count 2827 transition count 2561
Iterating global reduction 4 with 7 rules applied. Total rules applied 6981 place count 2827 transition count 2561
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6981 place count 2827 transition count 2557
Deduced a syphon composed of 4 places in 37 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6989 place count 2823 transition count 2557
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9275 place count 1680 transition count 1270
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9276 place count 1679 transition count 1269
Reduce places removed 190 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 4 with 284 rules applied. Total rules applied 9560 place count 1489 transition count 1175
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 9654 place count 1395 transition count 1175
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9654 place count 1395 transition count 1079
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9846 place count 1299 transition count 1079
Applied a total of 9846 rules in 1399 ms. Remains 1299 /6270 variables (removed 4971) and now considering 1079/6101 (removed 5022) transitions.
// Phase 1: matrix 1079 rows 1299 cols
[2024-05-21 14:42:52] [INFO ] Computed 324 invariants in 5 ms
[2024-05-21 14:42:54] [INFO ] Implicit Places using invariants in 1829 ms returned [511, 585, 659, 697, 735, 809, 883, 921, 959, 963, 967, 971, 975, 980, 984, 988, 992, 996, 1000, 1004, 1008, 1012, 1016, 1020, 1024, 1028, 1032, 1036, 1040, 1044, 1048, 1052, 1056, 1060, 1064, 1068, 1072, 1076, 1080, 1084, 1088, 1092, 1096, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1180, 1184, 1188, 1192, 1196, 1200, 1204, 1208, 1213, 1217, 1221, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1293, 1298]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1831 ms to find 105 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1194/6270 places, 1079/6101 transitions.
Graph (trivial) has 494 edges and 1194 vertex of which 25 / 1194 are part of one of the 1 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1091 transition count 953
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1091 transition count 953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1087 transition count 949
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1087 transition count 949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1083 transition count 945
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1083 transition count 945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1079 transition count 941
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1079 transition count 941
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1075 transition count 937
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1075 transition count 937
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1071 transition count 933
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1071 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1067 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1067 transition count 929
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1063 transition count 925
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1063 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1059 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1059 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1055 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1055 transition count 917
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1051 transition count 913
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1051 transition count 913
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1047 transition count 909
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1047 transition count 909
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1043 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1043 transition count 905
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1041 transition count 903
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1041 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1039 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1039 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1037 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1037 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1035 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1035 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1033 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1033 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1031 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1031 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1029 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1029 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1027 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1027 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1025 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1025 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1023 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1023 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1021 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1021 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1019 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1019 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1018 transition count 880
Applied a total of 305 rules in 781 ms. Remains 1018 /1194 variables (removed 176) and now considering 880/1079 (removed 199) transitions.
// Phase 1: matrix 880 rows 1018 cols
[2024-05-21 14:42:55] [INFO ] Computed 219 invariants in 5 ms
[2024-05-21 14:42:56] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-21 14:42:56] [INFO ] Invariant cache hit.
[2024-05-21 14:42:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:42:58] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 3119 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1018/6270 places, 880/6101 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7133 ms. Remains : 1018/6270 places, 880/6101 transitions.
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s508 1), p0:(EQ s196 1), p1:(AND (EQ s433 1) (EQ s848 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property AutoFlight-PT-96b-LTLFireability-02 finished in 7404 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&X(X(X(G(p0))))))||X(F(p1)))))'
[2024-05-21 14:42:58] [INFO ] Flatten gal took : 129 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3523622423480920544
[2024-05-21 14:42:59] [INFO ] Too many transitions (6101) to apply POR reductions. Disabling POR matrices.
[2024-05-21 14:42:59] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3523622423480920544
Running compilation step : cd /tmp/ltsmin3523622423480920544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 14:42:59] [INFO ] Applying decomposition
[2024-05-21 14:42:59] [INFO ] Flatten gal took : 212 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5296251010989630470.txt' '-o' '/tmp/graph5296251010989630470.bin' '-w' '/tmp/graph5296251010989630470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5296251010989630470.bin' '-l' '-1' '-v' '-w' '/tmp/graph5296251010989630470.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:42:59] [INFO ] Decomposing Gal with order
[2024-05-21 14:43:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:43:02] [INFO ] Removed a total of 1110 redundant transitions.
[2024-05-21 14:43:02] [INFO ] Flatten gal took : 250 ms
[2024-05-21 14:43:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2024-05-21 14:43:02] [INFO ] Time to serialize gal into /tmp/LTLFireability8201661694558059658.gal : 55 ms
[2024-05-21 14:43:02] [INFO ] Time to serialize properties into /tmp/LTLFireability5700917014227656006.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8201661694558059658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5700917014227656006.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(((X(F(("(i22.u458.p1497==1)")&&(X(("(i22.u458.p1497==1)")U((!("((i6.u795.p2814==1)&&(i6.u1982.p6198==1))"))||(G("(i22.u458.p1497=...350
Formula 0 simplified : G(FG(!"(i22.u458.p1497==1)" | X(!"(i22.u458.p1497==1)" M "((i6.u795.p2814==1)&&(i6.u1982.p6198==1))")) & (F!"(i2.i1.i2.i1.u1243.p437...266
Compilation finished in 42383 ms.
Running link step : cd /tmp/ltsmin3523622423480920544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin3523622423480920544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X(<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))&&[]((LTLAPp2==true)))||[](<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3523622423480920544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X(<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))&&[]((LTLAPp2==true)))||[](<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3523622423480920544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 15:06:22] [INFO ] Applying decomposition
[2024-05-21 15:06:25] [INFO ] Flatten gal took : 2190 ms
[2024-05-21 15:06:33] [INFO ] Decomposing Gal with order
[2024-05-21 15:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:07:14] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-21 15:07:14] [INFO ] Flatten gal took : 431 ms
[2024-05-21 15:09:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10710 labels/synchronizations in 94821 ms.
[2024-05-21 15:09:18] [INFO ] Time to serialize gal into /tmp/LTLFireability15145496149732327469.gal : 5054 ms
[2024-05-21 15:09:19] [INFO ] Time to serialize properties into /tmp/LTLFireability2697904629195916939.ltl : 151 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15145496149732327469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2697904629195916939.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((F(((X(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....8243
Formula 0 simplified : G(FG(!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...6217
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3523622423480920544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3523622423480920544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](((LTLAPp4==true)&&X(X(X([]((LTLAPp4==true)))))))||X(<>((LTLAPp5==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-21 15:24:31] [INFO ] Flatten gal took : 457 ms
[2024-05-21 15:24:43] [INFO ] Input system was already deterministic with 6101 transitions.
[2024-05-21 15:24:44] [INFO ] Transformed 6270 places.
[2024-05-21 15:24:44] [INFO ] Transformed 6101 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-21 15:25:00] [INFO ] Time to serialize gal into /tmp/LTLFireability16453765497976146317.gal : 68 ms
[2024-05-21 15:25:00] [INFO ] Time to serialize properties into /tmp/LTLFireability1391859661631635844.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16453765497976146317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1391859661631635844.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((X(F(("(p1497==1)")&&(X(("(p1497==1)")U((!("((p2814==1)&&(p6198==1))"))||(G("(p1497==1)"))))))))&&(G("(p4375!=1)")))||(G(F(("(p1...244
Formula 0 simplified : G(FG(!"(p1497==1)" | X(!"(p1497==1)" M "((p2814==1)&&(p6198==1))")) & (F!"(p4375!=1)" | XG(!"(p1497==1)" | X(!"(p1497==1)" M "((p281...178
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6394316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11349400 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-96b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-96b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180200133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-96b.tgz
mv AutoFlight-PT-96b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;