About the Execution of ITS-Tools for PolyORBNT-PT-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16213.936 | 3600000.00 | 7968124.00 | 229534.80 | ?FF?FFFFFFFTFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017300844.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-PT-S05J80, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300844
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 92K Apr 30 03:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 377K Apr 30 03:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 30 03:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 183K Apr 30 03:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 26K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 67K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 218K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J80-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652966293890
Running Version 202205111006
[2022-05-19 13:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 13:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:18:15] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2022-05-19 13:18:15] [INFO ] Transformed 1189 places.
[2022-05-19 13:18:15] [INFO ] Transformed 2350 transitions.
[2022-05-19 13:18:15] [INFO ] Parsed PT model containing 1189 places and 2350 transitions in 345 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2022-05-19 13:18:15] [INFO ] Reduced 555 identical enabling conditions.
[2022-05-19 13:18:15] [INFO ] Reduced 555 identical enabling conditions.
[2022-05-19 13:18:15] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 677 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1185 transition count 1695
Applied a total of 4 rules in 79 ms. Remains 1185 /1189 variables (removed 4) and now considering 1695/1695 (removed 0) transitions.
[2022-05-19 13:18:15] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1185 cols
[2022-05-19 13:18:15] [INFO ] Computed 178 place invariants in 205 ms
[2022-05-19 13:18:19] [INFO ] Dead Transitions using invariants and state equation in 4224 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2022-05-19 13:18:19] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1185 cols
[2022-05-19 13:18:20] [INFO ] Computed 178 place invariants in 144 ms
[2022-05-19 13:18:21] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2022-05-19 13:18:21] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1185 cols
[2022-05-19 13:18:21] [INFO ] Computed 178 place invariants in 52 ms
[2022-05-19 13:18:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:18:39] [INFO ] Implicit Places using invariants and state equation in 18240 ms returned []
Implicit Place search using SMT with State Equation took 19688 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1185/1189 places, 1600/1695 transitions.
Applied a total of 0 rules in 28 ms. Remains 1185 /1185 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1185/1189 places, 1600/1695 transitions.
Support contains 677 out of 1185 places after structural reductions.
[2022-05-19 13:18:40] [INFO ] Flatten gal took : 217 ms
[2022-05-19 13:18:40] [INFO ] Flatten gal took : 162 ms
[2022-05-19 13:18:40] [INFO ] Input system was already deterministic with 1600 transitions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 21) seen :18
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-19 13:18:41] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1185 cols
[2022-05-19 13:18:41] [INFO ] Computed 178 place invariants in 36 ms
[2022-05-19 13:18:41] [INFO ] [Real]Absence check using 156 positive place invariants in 35 ms returned sat
[2022-05-19 13:18:41] [INFO ] [Real]Absence check using 156 positive and 22 generalized place invariants in 49 ms returned sat
[2022-05-19 13:18:41] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:18:41] [INFO ] [Nat]Absence check using 156 positive place invariants in 36 ms returned sat
[2022-05-19 13:18:41] [INFO ] [Nat]Absence check using 156 positive and 22 generalized place invariants in 62 ms returned sat
[2022-05-19 13:18:43] [INFO ] After 1742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:18:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:18:46] [INFO ] After 2556ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:18:46] [INFO ] After 2673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-19 13:18:46] [INFO ] After 4746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 1184 transition count 1514
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 173 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 343 place count 1013 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 344 place count 1012 transition count 1428
Iterating global reduction 2 with 1 rules applied. Total rules applied 345 place count 1012 transition count 1428
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 1010 transition count 1426
Applied a total of 349 rules in 432 ms. Remains 1010 /1185 variables (removed 175) and now considering 1426/1600 (removed 174) transitions.
[2022-05-19 13:18:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-19 13:18:46] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:18:48] [INFO ] Dead Transitions using invariants and state equation in 2163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1185 places, 1426/1600 transitions.
Finished random walk after 38 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(X(p0) U p1))))'
Support contains 1 out of 1185 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 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1184 transition count 1597
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1181 transition count 1596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1180 transition count 1596
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 8 place count 1180 transition count 1511
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 178 place count 1095 transition count 1511
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 1093 transition count 1509
Applied a total of 182 rules in 169 ms. Remains 1093 /1185 variables (removed 92) and now considering 1509/1600 (removed 91) transitions.
[2022-05-19 13:18:49] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:18:49] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:18:51] [INFO ] Dead Transitions using invariants and state equation in 2486 ms found 0 transitions.
[2022-05-19 13:18:51] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:18:51] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:18:53] [INFO ] Implicit Places using invariants in 1542 ms returned []
[2022-05-19 13:18:53] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:18:53] [INFO ] Computed 177 place invariants in 53 ms
[2022-05-19 13:18:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:19:05] [INFO ] Implicit Places using invariants and state equation in 12194 ms returned []
Implicit Place search using SMT with State Equation took 13739 ms to find 0 implicit places.
[2022-05-19 13:19:05] [INFO ] Redundant transitions in 96 ms returned []
[2022-05-19 13:19:05] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:19:05] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:19:08] [INFO ] Dead Transitions using invariants and state equation in 2585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1185 places, 1509/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1185 places, 1509/1600 transitions.
Stuttering acceptance computed with spot in 133 ms :[p1]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s418 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4909 reset in 958 ms.
Product exploration explored 100000 steps with 4957 reset in 939 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[p1]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[p1]
Stuttering acceptance computed with spot in 25 ms :[p1]
Support contains 1 out of 1093 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 : 1093/1093 places, 1509/1509 transitions.
Applied a total of 0 rules in 44 ms. Remains 1093 /1093 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
[2022-05-19 13:19:10] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:19:10] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:19:13] [INFO ] Dead Transitions using invariants and state equation in 2519 ms found 0 transitions.
[2022-05-19 13:19:13] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:19:13] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:19:14] [INFO ] Implicit Places using invariants in 1480 ms returned []
[2022-05-19 13:19:14] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:19:14] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:19:27] [INFO ] Implicit Places using invariants and state equation in 12300 ms returned []
Implicit Place search using SMT with State Equation took 13782 ms to find 0 implicit places.
[2022-05-19 13:19:27] [INFO ] Redundant transitions in 69 ms returned []
[2022-05-19 13:19:27] [INFO ] Flow matrix only has 1505 transitions (discarded 4 similar events)
// Phase 1: matrix 1505 rows 1093 cols
[2022-05-19 13:19:27] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:19:29] [INFO ] Dead Transitions using invariants and state equation in 2645 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1093 places, 1509/1509 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[p1]
Finished random walk after 29 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[p1]
Stuttering acceptance computed with spot in 33 ms :[p1]
Stuttering acceptance computed with spot in 39 ms :[p1]
Product exploration explored 100000 steps with 4964 reset in 860 ms.
Product exploration explored 100000 steps with 4916 reset in 930 ms.
Built C files in :
/tmp/ltsmin10904205716243592471
[2022-05-19 13:19:32] [INFO ] Too many transitions (1509) to apply POR reductions. Disabling POR matrices.
[2022-05-19 13:19:32] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10904205716243592471
Running compilation step : cd /tmp/ltsmin10904205716243592471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10904205716243592471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10904205716243592471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 1509/1509 transitions.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 1093 transition count 1428
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 1012 transition count 1428
Applied a total of 162 rules in 84 ms. Remains 1012 /1093 variables (removed 81) and now considering 1428/1509 (removed 81) transitions.
[2022-05-19 13:19:35] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:19:35] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-19 13:19:37] [INFO ] Dead Transitions using invariants and state equation in 1987 ms found 0 transitions.
[2022-05-19 13:19:37] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:19:37] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:19:39] [INFO ] Implicit Places using invariants in 2500 ms returned []
[2022-05-19 13:19:39] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:19:39] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-19 13:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:19:48] [INFO ] Implicit Places using invariants and state equation in 9169 ms returned []
Implicit Place search using SMT with State Equation took 11671 ms to find 0 implicit places.
[2022-05-19 13:19:48] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-19 13:19:48] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:19:48] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:19:51] [INFO ] Dead Transitions using invariants and state equation in 2114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1093 places, 1428/1509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1093 places, 1428/1509 transitions.
Built C files in :
/tmp/ltsmin15635206145359226041
[2022-05-19 13:19:51] [INFO ] Computing symmetric may disable matrix : 1428 transitions.
[2022-05-19 13:19:51] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:19:51] [INFO ] Computing symmetric may enable matrix : 1428 transitions.
[2022-05-19 13:19:51] [INFO ] Computation of Complete enable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:19:51] [INFO ] Computing Do-Not-Accords matrix : 1428 transitions.
[2022-05-19 13:19:51] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:19:51] [INFO ] Built C files in 405ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15635206145359226041
Running compilation step : cd /tmp/ltsmin15635206145359226041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15635206145359226041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15635206145359226041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 13:19:54] [INFO ] Flatten gal took : 100 ms
[2022-05-19 13:19:54] [INFO ] Flatten gal took : 90 ms
[2022-05-19 13:19:54] [INFO ] Time to serialize gal into /tmp/LTL17631344306730070476.gal : 15 ms
[2022-05-19 13:19:54] [INFO ] Time to serialize properties into /tmp/LTL18201475494031933752.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17631344306730070476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18201475494031933752.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1763134...268
Read 1 LTL properties
Checking formula 0 : !((F(G(!((X("((((((((((((((((((mi2>=1)&&(QueueJobB_1_60>=1))&&(block>=1))||(((QueueJobB_1_24>=1)&&(mi2>=1))&&(block>=1)))||((((QueueJo...29362
Formula 0 simplified : !FG!(X"((((((((((((((((((mi2>=1)&&(QueueJobB_1_60>=1))&&(block>=1))||(((QueueJobB_1_24>=1)&&(mi2>=1))&&(block>=1)))||((((QueueJobB_1...29352
Detected timeout of ITS tools.
[2022-05-19 13:20:10] [INFO ] Flatten gal took : 85 ms
[2022-05-19 13:20:10] [INFO ] Applying decomposition
[2022-05-19 13:20:10] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9548451224146682580.txt' '-o' '/tmp/graph9548451224146682580.bin' '-w' '/tmp/graph9548451224146682580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9548451224146682580.bin' '-l' '-1' '-v' '-w' '/tmp/graph9548451224146682580.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:20:10] [INFO ] Decomposing Gal with order
[2022-05-19 13:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:20:11] [INFO ] Removed a total of 1764 redundant transitions.
[2022-05-19 13:20:11] [INFO ] Flatten gal took : 680 ms
[2022-05-19 13:20:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 564 labels/synchronizations in 84 ms.
[2022-05-19 13:20:11] [INFO ] Time to serialize gal into /tmp/LTL3084325284127824806.gal : 22 ms
[2022-05-19 13:20:11] [INFO ] Time to serialize properties into /tmp/LTL9735921806129779957.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3084325284127824806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9735921806129779957.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3084325...245
Read 1 LTL properties
Checking formula 0 : !((F(G(!((X("((((((((((((((((((i46.u96.mi2>=1)&&(i46.u96.QueueJobB_1_60>=1))&&(i46.u126.block>=1))||(((i46.u96.QueueJobB_1_24>=1)&&(i4...40745
Formula 0 simplified : !FG!(X"((((((((((((((((((i46.u96.mi2>=1)&&(i46.u96.QueueJobB_1_60>=1))&&(i46.u126.block>=1))||(((i46.u96.QueueJobB_1_24>=1)&&(i46.u9...40735
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10618390603750645630
[2022-05-19 13:20:26] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10618390603750645630
Running compilation step : cd /tmp/ltsmin10618390603750645630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10618390603750645630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10618390603750645630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-00 finished in 100247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0 U G(X(X(p0)))))) U (p1&&(F(p3)||p2))))'
Support contains 91 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1183 transition count 1599
Applied a total of 3 rules in 69 ms. Remains 1183 /1185 variables (removed 2) and now considering 1599/1600 (removed 1) transitions.
[2022-05-19 13:20:29] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:20:29] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:20:33] [INFO ] Dead Transitions using invariants and state equation in 3461 ms found 0 transitions.
[2022-05-19 13:20:33] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:20:33] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:20:35] [INFO ] Implicit Places using invariants in 2589 ms returned []
[2022-05-19 13:20:35] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:20:35] [INFO ] Computed 177 place invariants in 29 ms
[2022-05-19 13:20:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:21:06] [INFO ] Performed 465/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:21:35] [INFO ] Implicit Places using invariants and state equation in 59523 ms returned []
Implicit Place search using SMT with State Equation took 62115 ms to find 0 implicit places.
[2022-05-19 13:21:35] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:21:35] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:21:38] [INFO ] Dead Transitions using invariants and state equation in 3695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1185 places, 1599/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1185 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p0), true, (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (NOT p3)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(OR (AND (GEQ s199 1) (GEQ s843 1) (GEQ s1095 1)) (AND (GEQ s121 1) (GEQ s843 1) (GEQ s1095 1)) (AND (GEQ s783 1) (GEQ s843 1) (GEQ s1095 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-02 finished in 69798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(X(p0)) U X((G(p2)||p1)))))'
Support contains 8 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1183 transition count 1599
Applied a total of 3 rules in 64 ms. Remains 1183 /1185 variables (removed 2) and now considering 1599/1600 (removed 1) transitions.
[2022-05-19 13:21:39] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:21:39] [INFO ] Computed 177 place invariants in 52 ms
[2022-05-19 13:21:42] [INFO ] Dead Transitions using invariants and state equation in 3638 ms found 0 transitions.
[2022-05-19 13:21:42] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:21:43] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:21:45] [INFO ] Implicit Places using invariants in 2638 ms returned []
[2022-05-19 13:21:45] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:21:45] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:21:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:22:16] [INFO ] Performed 458/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:22:46] [INFO ] Performed 1016/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:22:53] [INFO ] Implicit Places using invariants and state equation in 67572 ms returned []
Implicit Place search using SMT with State Equation took 70212 ms to find 0 implicit places.
[2022-05-19 13:22:53] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:22:53] [INFO ] Computed 177 place invariants in 41 ms
[2022-05-19 13:22:56] [INFO ] Dead Transitions using invariants and state equation in 3484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1185 places, 1599/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1185 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR p1 p2), (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p2]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s865 1), p1:(OR (AND (GEQ s575 6) (GEQ s1050 1) (GEQ s1081 1) (GEQ s1096 3)) (AND (GEQ s575 6) (GEQ s939 3) (GEQ s1050 1) (GEQ s1081 1)) (AND (GEQ...], nbAcceptance=2, 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 6936 reset in 1319 ms.
Product exploration explored 100000 steps with 6966 reset in 1263 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 832 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(OR p1 p2), (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p2]
Incomplete random walk after 10001 steps, including 675 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-19 13:23:01] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:23:01] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:23:01] [INFO ] [Real]Absence check using 156 positive place invariants in 29 ms returned sat
[2022-05-19 13:23:01] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 50 ms returned sat
[2022-05-19 13:23:01] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-19 13:23:01] [INFO ] [Nat]Absence check using 156 positive place invariants in 32 ms returned sat
[2022-05-19 13:23:01] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 53 ms returned sat
[2022-05-19 13:23:01] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p1), (F p2)]
Knowledge based reduction with 11 factoid took 792 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 138 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Support contains 8 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Applied a total of 0 rules in 31 ms. Remains 1183 /1183 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2022-05-19 13:23:02] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:23:02] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:23:06] [INFO ] Dead Transitions using invariants and state equation in 3632 ms found 0 transitions.
[2022-05-19 13:23:06] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:23:06] [INFO ] Computed 177 place invariants in 29 ms
[2022-05-19 13:23:09] [INFO ] Implicit Places using invariants in 2603 ms returned []
[2022-05-19 13:23:09] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:23:09] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-19 13:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:23:40] [INFO ] Performed 524/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:24:10] [INFO ] Performed 981/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:24:18] [INFO ] Implicit Places using invariants and state equation in 69115 ms returned []
Implicit Place search using SMT with State Equation took 71722 ms to find 0 implicit places.
[2022-05-19 13:24:18] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:24:18] [INFO ] Computed 177 place invariants in 43 ms
[2022-05-19 13:24:21] [INFO ] Dead Transitions using invariants and state equation in 3438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1183 places, 1599/1599 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 504 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 678 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :4
Finished Best-First random walk after 44 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p0 (NOT p2)))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 6 factoid took 698 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 172 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 138 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 168 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 6950 reset in 1109 ms.
Product exploration explored 100000 steps with 6954 reset in 1132 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 183 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Support contains 8 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1183 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 1182 transition count 1598
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 1182 transition count 1598
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 171 place count 1182 transition count 1598
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 254 place count 1099 transition count 1515
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 337 place count 1099 transition count 1515
Deduced a syphon composed of 85 places in 1 ms
Applied a total of 337 rules in 382 ms. Remains 1099 /1183 variables (removed 84) and now considering 1515/1599 (removed 84) transitions.
[2022-05-19 13:24:26] [INFO ] Flow matrix only has 1511 transitions (discarded 4 similar events)
// Phase 1: matrix 1511 rows 1099 cols
[2022-05-19 13:24:26] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:24:29] [INFO ] Dead Transitions using invariants and state equation in 2440 ms found 0 transitions.
[2022-05-19 13:24:29] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 13:24:29] [INFO ] Flow matrix only has 1511 transitions (discarded 4 similar events)
// Phase 1: matrix 1511 rows 1099 cols
[2022-05-19 13:24:29] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:24:31] [INFO ] Dead Transitions using invariants and state equation in 2417 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1099/1183 places, 1515/1599 transitions.
Finished structural reductions, in 1 iterations. Remains : 1099/1183 places, 1515/1599 transitions.
Product exploration explored 100000 steps with 6919 reset in 1245 ms.
Product exploration explored 100000 steps with 6833 reset in 1231 ms.
Built C files in :
/tmp/ltsmin917612250967099282
[2022-05-19 13:24:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin917612250967099282
Running compilation step : cd /tmp/ltsmin917612250967099282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin917612250967099282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin917612250967099282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 8 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Applied a total of 0 rules in 37 ms. Remains 1183 /1183 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2022-05-19 13:24:37] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:24:37] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:24:40] [INFO ] Dead Transitions using invariants and state equation in 3305 ms found 0 transitions.
[2022-05-19 13:24:40] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:24:40] [INFO ] Computed 177 place invariants in 28 ms
[2022-05-19 13:24:43] [INFO ] Implicit Places using invariants in 2680 ms returned []
[2022-05-19 13:24:43] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:24:43] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:25:14] [INFO ] Performed 513/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:25:39] [INFO ] Implicit Places using invariants and state equation in 56600 ms returned []
Implicit Place search using SMT with State Equation took 59282 ms to find 0 implicit places.
[2022-05-19 13:25:39] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:25:39] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:25:43] [INFO ] Dead Transitions using invariants and state equation in 3492 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1183 places, 1599/1599 transitions.
Built C files in :
/tmp/ltsmin2789195444947115078
[2022-05-19 13:25:43] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2789195444947115078
Running compilation step : cd /tmp/ltsmin2789195444947115078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2789195444947115078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2789195444947115078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 13:25:46] [INFO ] Flatten gal took : 77 ms
[2022-05-19 13:25:46] [INFO ] Flatten gal took : 77 ms
[2022-05-19 13:25:46] [INFO ] Time to serialize gal into /tmp/LTL1821748910890151992.gal : 249 ms
[2022-05-19 13:25:46] [INFO ] Time to serialize properties into /tmp/LTL5908625639662858222.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1821748910890151992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5908625639662858222.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1821748...266
Read 1 LTL properties
Checking formula 0 : !((F(!((F(X("(Schedule_Task_B_1>=1)")))U(X((((((((G("((((((cSources>=9)&&(ModifiedSrc_4>=1))&&(place_500_1>=1))||(((cSources>=9)&&(Mod...6834
Formula 0 simplified : !F!(FX"(Schedule_Task_B_1>=1)" U X("((((((((cSources>=6)&&(ModifiedSrc_2>=1))&&((place_500_1>=1)&&(ModifiedSrc_5>=3)))||((((cSources...6801
Detected timeout of ITS tools.
[2022-05-19 13:26:01] [INFO ] Flatten gal took : 70 ms
[2022-05-19 13:26:01] [INFO ] Applying decomposition
[2022-05-19 13:26:02] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12815562163261702290.txt' '-o' '/tmp/graph12815562163261702290.bin' '-w' '/tmp/graph12815562163261702290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12815562163261702290.bin' '-l' '-1' '-v' '-w' '/tmp/graph12815562163261702290.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:26:02] [INFO ] Decomposing Gal with order
[2022-05-19 13:26:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:26:02] [INFO ] Removed a total of 1761 redundant transitions.
[2022-05-19 13:26:02] [INFO ] Flatten gal took : 311 ms
[2022-05-19 13:26:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 526 labels/synchronizations in 56 ms.
[2022-05-19 13:26:02] [INFO ] Time to serialize gal into /tmp/LTL2211063708223845714.gal : 17 ms
[2022-05-19 13:26:02] [INFO ] Time to serialize properties into /tmp/LTL7333881796993029937.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2211063708223845714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7333881796993029937.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2211063...245
Read 1 LTL properties
Checking formula 0 : !((F(!((F(X("(i52.i8.u121.Schedule_Task_B_1>=1)")))U(X((((((((G("((((((i34.u96.cSources>=9)&&(i34.u96.ModifiedSrc_4>=1))&&(i34.u96.pla...9486
Formula 0 simplified : !F!(FX"(i52.i8.u121.Schedule_Task_B_1>=1)" U X("((((((((i34.u96.cSources>=6)&&(i34.u96.ModifiedSrc_2>=1))&&((i34.u96.place_500_1>=1)...9453
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin917826198912720132
[2022-05-19 13:26:17] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin917826198912720132
Running compilation step : cd /tmp/ltsmin917826198912720132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin917826198912720132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin917826198912720132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-03 finished in 281556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 84 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1184 transition count 1516
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1100 transition count 1516
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 168 place count 1100 transition count 1431
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 338 place count 1015 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 1014 transition count 1430
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 1014 transition count 1430
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 1012 transition count 1428
Applied a total of 344 rules in 140 ms. Remains 1012 /1185 variables (removed 173) and now considering 1428/1600 (removed 172) transitions.
[2022-05-19 13:26:20] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:26:21] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:26:22] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
[2022-05-19 13:26:22] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:26:22] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:26:25] [INFO ] Implicit Places using invariants in 2214 ms returned []
[2022-05-19 13:26:25] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:26:25] [INFO ] Computed 177 place invariants in 29 ms
[2022-05-19 13:26:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:26:54] [INFO ] Implicit Places using invariants and state equation in 29689 ms returned []
Implicit Place search using SMT with State Equation took 31905 ms to find 0 implicit places.
[2022-05-19 13:26:54] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-19 13:26:54] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:26:54] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:26:56] [INFO ] Dead Transitions using invariants and state equation in 2044 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1185 places, 1428/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1185 places, 1428/1600 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s567 1) (LT s741 1) (LT s933 1)) (OR (LT s472 1) (LT s567 1) (LT s933 1)) (OR (LT s216 1) (LT s567 1) (LT s933 1)) (OR (LT s567 1) (LT s67...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 320 steps with 46 reset in 4 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-04 finished in 36201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1184 transition count 1514
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1098 transition count 1514
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 172 place count 1098 transition count 1430
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 340 place count 1014 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1013 transition count 1429
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1013 transition count 1429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 346 place count 1011 transition count 1427
Applied a total of 346 rules in 155 ms. Remains 1011 /1185 variables (removed 174) and now considering 1427/1600 (removed 173) transitions.
[2022-05-19 13:26:57] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2022-05-19 13:26:57] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:26:59] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
[2022-05-19 13:26:59] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2022-05-19 13:26:59] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:27:01] [INFO ] Implicit Places using invariants in 2454 ms returned []
[2022-05-19 13:27:01] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2022-05-19 13:27:01] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:27:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:27:30] [INFO ] Implicit Places using invariants and state equation in 29240 ms returned []
Implicit Place search using SMT with State Equation took 31697 ms to find 0 implicit places.
[2022-05-19 13:27:30] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-19 13:27:30] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2022-05-19 13:27:30] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-19 13:27:32] [INFO ] Dead Transitions using invariants and state equation in 1991 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1011/1185 places, 1427/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1185 places, 1427/1600 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-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:(AND (GEQ s519 1) (GEQ s630 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 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-05 finished in 36013 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(G(p0))))))'
Support contains 83 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1184 transition count 1514
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 172 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 342 place count 1013 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 343 place count 1012 transition count 1428
Iterating global reduction 2 with 1 rules applied. Total rules applied 344 place count 1012 transition count 1428
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 348 place count 1010 transition count 1426
Applied a total of 348 rules in 123 ms. Remains 1010 /1185 variables (removed 175) and now considering 1426/1600 (removed 174) transitions.
[2022-05-19 13:27:33] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-19 13:27:33] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:27:35] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
[2022-05-19 13:27:35] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-19 13:27:35] [INFO ] Computed 177 place invariants in 42 ms
[2022-05-19 13:27:37] [INFO ] Implicit Places using invariants in 2419 ms returned []
[2022-05-19 13:27:37] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-19 13:27:37] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:27:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:28:00] [INFO ] Implicit Places using invariants and state equation in 23079 ms returned []
Implicit Place search using SMT with State Equation took 25500 ms to find 0 implicit places.
[2022-05-19 13:28:00] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-19 13:28:00] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-19 13:28:00] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:28:02] [INFO ] Dead Transitions using invariants and state equation in 2069 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1185 places, 1426/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1185 places, 1426/1600 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s76 1) (GEQ s721 1) (GEQ s726 1)) (AND (GEQ s721 1) (GEQ s726 1) (GEQ s727 1)) (AND (GEQ s214 1) (GEQ s721 1) (GEQ s726 1)) (AND (GEQ s3 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-07 finished in 29677 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(G(X(G(p0))))||G(X(p0)))))'
Support contains 1 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1184 transition count 1515
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1099 transition count 1515
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1099 transition count 1430
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1014 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1013 transition count 1429
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1013 transition count 1429
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 2 with 2 rules applied. Total rules applied 344 place count 1012 transition count 1428
Applied a total of 344 rules in 131 ms. Remains 1012 /1185 variables (removed 173) and now considering 1428/1600 (removed 172) transitions.
[2022-05-19 13:28:02] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:28:02] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:28:04] [INFO ] Dead Transitions using invariants and state equation in 2037 ms found 0 transitions.
[2022-05-19 13:28:04] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:28:04] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:28:07] [INFO ] Implicit Places using invariants in 2485 ms returned []
[2022-05-19 13:28:07] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:28:07] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:28:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:28:29] [INFO ] Implicit Places using invariants and state equation in 21736 ms returned []
Implicit Place search using SMT with State Equation took 24222 ms to find 0 implicit places.
[2022-05-19 13:28:29] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-19 13:28:29] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:28:29] [INFO ] Computed 177 place invariants in 43 ms
[2022-05-19 13:28:31] [INFO ] Dead Transitions using invariants and state equation in 2036 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1185 places, 1428/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1185 places, 1428/1600 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-08 finished in 28522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(G(X(p0)))||G(X(p0))||p1)))'
Support contains 2 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1184 transition count 1600
Applied a total of 1 rules in 35 ms. Remains 1184 /1185 variables (removed 1) and now considering 1600/1600 (removed 0) transitions.
[2022-05-19 13:28:31] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1184 cols
[2022-05-19 13:28:31] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:28:34] [INFO ] Dead Transitions using invariants and state equation in 3518 ms found 0 transitions.
[2022-05-19 13:28:34] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1184 cols
[2022-05-19 13:28:34] [INFO ] Computed 177 place invariants in 29 ms
[2022-05-19 13:28:37] [INFO ] Implicit Places using invariants in 2842 ms returned []
[2022-05-19 13:28:37] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1184 cols
[2022-05-19 13:28:37] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:28:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:29:08] [INFO ] Performed 674/1184 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:29:31] [INFO ] Implicit Places using invariants and state equation in 53629 ms returned []
Implicit Place search using SMT with State Equation took 56476 ms to find 0 implicit places.
[2022-05-19 13:29:31] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1184 cols
[2022-05-19 13:29:31] [INFO ] Computed 177 place invariants in 29 ms
[2022-05-19 13:29:34] [INFO ] Dead Transitions using invariants and state equation in 3509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1184/1185 places, 1600/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1184/1185 places, 1600/1600 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s33 1), p0:(GEQ s686 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1234 steps with 84 reset in 14 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-10 finished in 63656 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||F(p2)))'
Support contains 5 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1184 transition count 1515
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1099 transition count 1515
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 170 place count 1099 transition count 1431
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 338 place count 1015 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 1014 transition count 1430
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 1014 transition count 1430
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 2 with 2 rules applied. Total rules applied 342 place count 1013 transition count 1429
Applied a total of 342 rules in 131 ms. Remains 1013 /1185 variables (removed 172) and now considering 1429/1600 (removed 171) transitions.
[2022-05-19 13:29:35] [INFO ] Flow matrix only has 1425 transitions (discarded 4 similar events)
// Phase 1: matrix 1425 rows 1013 cols
[2022-05-19 13:29:35] [INFO ] Computed 177 place invariants in 45 ms
[2022-05-19 13:29:37] [INFO ] Dead Transitions using invariants and state equation in 2072 ms found 0 transitions.
[2022-05-19 13:29:37] [INFO ] Flow matrix only has 1425 transitions (discarded 4 similar events)
// Phase 1: matrix 1425 rows 1013 cols
[2022-05-19 13:29:37] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:29:39] [INFO ] Implicit Places using invariants in 2567 ms returned []
[2022-05-19 13:29:39] [INFO ] Flow matrix only has 1425 transitions (discarded 4 similar events)
// Phase 1: matrix 1425 rows 1013 cols
[2022-05-19 13:29:39] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:29:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:30:10] [INFO ] Performed 803/1013 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:30:15] [INFO ] Implicit Places using invariants and state equation in 36268 ms returned []
Implicit Place search using SMT with State Equation took 38839 ms to find 0 implicit places.
[2022-05-19 13:30:15] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-19 13:30:15] [INFO ] Flow matrix only has 1425 transitions (discarded 4 similar events)
// Phase 1: matrix 1425 rows 1013 cols
[2022-05-19 13:30:16] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:30:18] [INFO ] Dead Transitions using invariants and state equation in 2085 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1013/1185 places, 1429/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1013/1185 places, 1429/1600 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(GEQ s63 1), p1:(GEQ s877 1), p0:(AND (GEQ s174 1) (GEQ s719 1) (GEQ s934 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, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-12 finished in 43264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||X(G(p0))))'
Support contains 2 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1183 transition count 1599
Applied a total of 3 rules in 68 ms. Remains 1183 /1185 variables (removed 2) and now considering 1599/1600 (removed 1) transitions.
[2022-05-19 13:30:18] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:30:18] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:30:21] [INFO ] Dead Transitions using invariants and state equation in 3658 ms found 0 transitions.
[2022-05-19 13:30:21] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:30:21] [INFO ] Computed 177 place invariants in 28 ms
[2022-05-19 13:30:24] [INFO ] Implicit Places using invariants in 2690 ms returned []
[2022-05-19 13:30:24] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:30:24] [INFO ] Computed 177 place invariants in 28 ms
[2022-05-19 13:30:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:30:55] [INFO ] Performed 469/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:31:25] [INFO ] Performed 1119/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:31:27] [INFO ] Implicit Places using invariants and state equation in 63327 ms returned []
Implicit Place search using SMT with State Equation took 66018 ms to find 0 implicit places.
[2022-05-19 13:31:27] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:31:27] [INFO ] Computed 177 place invariants in 46 ms
[2022-05-19 13:31:31] [INFO ] Dead Transitions using invariants and state equation in 3542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1185 places, 1599/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1185 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s642 1) (LT s1113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1134 ms.
Product exploration explored 100000 steps with 50000 reset in 1136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-13 finished in 75699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(X(X(X(!F(p0))))) U !p0)))))'
Support contains 1 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1183 transition count 1599
Applied a total of 3 rules in 60 ms. Remains 1183 /1185 variables (removed 2) and now considering 1599/1600 (removed 1) transitions.
[2022-05-19 13:31:33] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:31:33] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-19 13:31:37] [INFO ] Dead Transitions using invariants and state equation in 3690 ms found 0 transitions.
[2022-05-19 13:31:37] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:31:37] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:31:40] [INFO ] Implicit Places using invariants in 2662 ms returned []
[2022-05-19 13:31:40] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:31:40] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:31:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:32:11] [INFO ] Performed 412/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:32:41] [INFO ] Performed 1030/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:32:48] [INFO ] Implicit Places using invariants and state equation in 68710 ms returned []
Implicit Place search using SMT with State Equation took 71374 ms to find 0 implicit places.
[2022-05-19 13:32:48] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:32:49] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-19 13:32:52] [INFO ] Dead Transitions using invariants and state equation in 3674 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1185 places, 1599/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1185 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(GEQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6906 reset in 361 ms.
Product exploration explored 100000 steps with 6932 reset in 387 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 187 ms :[true, p0, p0, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110677 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110677 steps, saw 34726 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 13:32:57] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:32:57] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:32:57] [INFO ] [Real]Absence check using 156 positive place invariants in 34 ms returned sat
[2022-05-19 13:32:57] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 50 ms returned sat
[2022-05-19 13:32:57] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:32:57] [INFO ] [Nat]Absence check using 156 positive place invariants in 31 ms returned sat
[2022-05-19 13:32:57] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 53 ms returned sat
[2022-05-19 13:32:59] [INFO ] After 2375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:32:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:33:01] [INFO ] After 2046ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:33:02] [INFO ] After 2142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-19 13:33:02] [INFO ] After 4828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1183 transition count 1515
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1099 transition count 1515
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1099 transition count 1431
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1015 transition count 1431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 342 place count 1012 transition count 1428
Applied a total of 342 rules in 109 ms. Remains 1012 /1183 variables (removed 171) and now considering 1428/1599 (removed 171) transitions.
[2022-05-19 13:33:02] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:33:02] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:33:04] [INFO ] Dead Transitions using invariants and state equation in 2017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1183 places, 1428/1599 transitions.
Finished random walk after 3773 steps, including 199 resets, run visited all 1 properties in 36 ms. (steps per millisecond=104 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 209 ms :[true, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 209 ms :[true, p0, p0, p0, p0, p0, p0]
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Applied a total of 0 rules in 36 ms. Remains 1183 /1183 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2022-05-19 13:33:04] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:33:04] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:33:08] [INFO ] Dead Transitions using invariants and state equation in 3610 ms found 0 transitions.
[2022-05-19 13:33:08] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:33:08] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:33:11] [INFO ] Implicit Places using invariants in 2667 ms returned []
[2022-05-19 13:33:11] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:33:11] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:33:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:33:42] [INFO ] Performed 558/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:34:12] [INFO ] Performed 1119/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:34:13] [INFO ] Implicit Places using invariants and state equation in 62614 ms returned []
Implicit Place search using SMT with State Equation took 65283 ms to find 0 implicit places.
[2022-05-19 13:34:13] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:34:13] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-19 13:34:17] [INFO ] Dead Transitions using invariants and state equation in 3616 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1183 places, 1599/1599 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 243 ms :[true, p0, p0, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 708 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 112 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 109247 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109247 steps, saw 34300 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 13:34:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:34:20] [INFO ] Computed 177 place invariants in 46 ms
[2022-05-19 13:34:21] [INFO ] [Real]Absence check using 156 positive place invariants in 33 ms returned sat
[2022-05-19 13:34:21] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 51 ms returned sat
[2022-05-19 13:34:21] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:34:21] [INFO ] [Nat]Absence check using 156 positive place invariants in 32 ms returned sat
[2022-05-19 13:34:21] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 53 ms returned sat
[2022-05-19 13:34:23] [INFO ] After 2417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:34:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:34:25] [INFO ] After 2035ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:34:26] [INFO ] After 2141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-05-19 13:34:26] [INFO ] After 4864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1183 transition count 1515
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1099 transition count 1515
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1099 transition count 1431
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1015 transition count 1431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 342 place count 1012 transition count 1428
Applied a total of 342 rules in 111 ms. Remains 1012 /1183 variables (removed 171) and now considering 1428/1599 (removed 171) transitions.
[2022-05-19 13:34:26] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:34:26] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:34:28] [INFO ] Dead Transitions using invariants and state equation in 2053 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1183 places, 1428/1599 transitions.
Finished random walk after 654 steps, including 32 resets, run visited all 1 properties in 8 ms. (steps per millisecond=81 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 196 ms :[true, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 227 ms :[true, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 220 ms :[true, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 6968 reset in 352 ms.
Product exploration explored 100000 steps with 6920 reset in 396 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[true, p0, p0, p0, p0, p0, p0]
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1183 transition count 1599
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 84 place count 1183 transition count 1600
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 1183 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1182 transition count 1599
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1182 transition count 1599
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 173 place count 1182 transition count 1599
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 256 place count 1099 transition count 1516
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 339 place count 1099 transition count 1516
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 339 rules in 185 ms. Remains 1099 /1183 variables (removed 84) and now considering 1516/1599 (removed 83) transitions.
[2022-05-19 13:34:30] [INFO ] Flow matrix only has 1512 transitions (discarded 4 similar events)
// Phase 1: matrix 1512 rows 1099 cols
[2022-05-19 13:34:30] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:34:32] [INFO ] Dead Transitions using invariants and state equation in 1926 ms found 0 transitions.
[2022-05-19 13:34:32] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-19 13:34:32] [INFO ] Flow matrix only has 1512 transitions (discarded 4 similar events)
// Phase 1: matrix 1512 rows 1099 cols
[2022-05-19 13:34:32] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-19 13:34:34] [INFO ] Dead Transitions using invariants and state equation in 2098 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1099/1183 places, 1516/1599 transitions.
Finished structural reductions, in 1 iterations. Remains : 1099/1183 places, 1516/1599 transitions.
Product exploration explored 100000 steps with 6973 reset in 386 ms.
Product exploration explored 100000 steps with 6885 reset in 422 ms.
Built C files in :
/tmp/ltsmin8476671751648251551
[2022-05-19 13:34:35] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8476671751648251551
Running compilation step : cd /tmp/ltsmin8476671751648251551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8476671751648251551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8476671751648251551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1599/1599 transitions.
Applied a total of 0 rules in 26 ms. Remains 1183 /1183 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2022-05-19 13:34:38] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:34:38] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-19 13:34:41] [INFO ] Dead Transitions using invariants and state equation in 3571 ms found 0 transitions.
[2022-05-19 13:34:41] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:34:41] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-19 13:34:44] [INFO ] Implicit Places using invariants in 2655 ms returned []
[2022-05-19 13:34:44] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:34:44] [INFO ] Computed 177 place invariants in 38 ms
[2022-05-19 13:34:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:35:15] [INFO ] Performed 775/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:35:37] [INFO ] Implicit Places using invariants and state equation in 52551 ms returned []
Implicit Place search using SMT with State Equation took 55208 ms to find 0 implicit places.
[2022-05-19 13:35:37] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2022-05-19 13:35:37] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-19 13:35:40] [INFO ] Dead Transitions using invariants and state equation in 3631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1183 places, 1599/1599 transitions.
Built C files in :
/tmp/ltsmin18216889663897368027
[2022-05-19 13:35:40] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18216889663897368027
Running compilation step : cd /tmp/ltsmin18216889663897368027;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18216889663897368027;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18216889663897368027;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 13:35:43] [INFO ] Flatten gal took : 83 ms
[2022-05-19 13:35:43] [INFO ] Flatten gal took : 67 ms
[2022-05-19 13:35:44] [INFO ] Time to serialize gal into /tmp/LTL11628158750977063604.gal : 11 ms
[2022-05-19 13:35:44] [INFO ] Time to serialize properties into /tmp/LTL15439036403058905718.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11628158750977063604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15439036403058905718.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1162815...268
Read 1 LTL properties
Checking formula 0 : !((G(X(G((X(X(X(X(!(F("(Schedule_Task_E_1_PerformWork_36>=1)")))))))U("(Schedule_Task_E_1_PerformWork_36<1)"))))))
Formula 0 simplified : !GXG(XXXX!F"(Schedule_Task_E_1_PerformWork_36>=1)" U "(Schedule_Task_E_1_PerformWork_36<1)")
Detected timeout of ITS tools.
[2022-05-19 13:35:59] [INFO ] Flatten gal took : 61 ms
[2022-05-19 13:35:59] [INFO ] Applying decomposition
[2022-05-19 13:35:59] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9929127985952273785.txt' '-o' '/tmp/graph9929127985952273785.bin' '-w' '/tmp/graph9929127985952273785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9929127985952273785.bin' '-l' '-1' '-v' '-w' '/tmp/graph9929127985952273785.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:35:59] [INFO ] Decomposing Gal with order
[2022-05-19 13:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:35:59] [INFO ] Removed a total of 1761 redundant transitions.
[2022-05-19 13:35:59] [INFO ] Flatten gal took : 225 ms
[2022-05-19 13:35:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 531 labels/synchronizations in 37 ms.
[2022-05-19 13:35:59] [INFO ] Time to serialize gal into /tmp/LTL10362850981296517243.gal : 13 ms
[2022-05-19 13:35:59] [INFO ] Time to serialize properties into /tmp/LTL13842569485674517439.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10362850981296517243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13842569485674517439.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1036285...247
Read 1 LTL properties
Checking formula 0 : !((G(X(G((X(X(X(X(!(F("(i8.u19.Schedule_Task_E_1_PerformWork_36>=1)")))))))U("(i8.u19.Schedule_Task_E_1_PerformWork_36<1)"))))))
Formula 0 simplified : !GXG(XXXX!F"(i8.u19.Schedule_Task_E_1_PerformWork_36>=1)" U "(i8.u19.Schedule_Task_E_1_PerformWork_36<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8187964451926353173
[2022-05-19 13:36:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8187964451926353173
Running compilation step : cd /tmp/ltsmin8187964451926353173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8187964451926353173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8187964451926353173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-14 finished in 283897 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(X(p1))))'
Support contains 5 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1184 transition count 1599
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1184 transition count 1599
Applied a total of 2 rules in 60 ms. Remains 1184 /1185 variables (removed 1) and now considering 1599/1600 (removed 1) transitions.
[2022-05-19 13:36:17] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:36:17] [INFO ] Computed 178 place invariants in 32 ms
[2022-05-19 13:36:21] [INFO ] Dead Transitions using invariants and state equation in 3741 ms found 0 transitions.
[2022-05-19 13:36:21] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:36:21] [INFO ] Computed 178 place invariants in 28 ms
[2022-05-19 13:36:24] [INFO ] Implicit Places using invariants in 2825 ms returned []
[2022-05-19 13:36:24] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:36:24] [INFO ] Computed 178 place invariants in 36 ms
[2022-05-19 13:36:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:36:55] [INFO ] Performed 692/1184 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:37:14] [INFO ] Implicit Places using invariants and state equation in 50411 ms returned []
Implicit Place search using SMT with State Equation took 53241 ms to find 0 implicit places.
[2022-05-19 13:37:14] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:37:14] [INFO ] Computed 178 place invariants in 37 ms
[2022-05-19 13:37:18] [INFO ] Dead Transitions using invariants and state equation in 3617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1184/1185 places, 1599/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1184/1185 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (LT s211 2) (OR (LT s575 1) (LT s671 1) (LT s838 1) (LT s1034 1))), p0:(LT s211 2)], 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 20207 reset in 648 ms.
Product exploration explored 100000 steps with 20034 reset in 660 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1287 steps, including 90 resets, run visited all 3 properties in 9 ms. (steps per millisecond=143 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1599/1599 transitions.
Applied a total of 0 rules in 27 ms. Remains 1184 /1184 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2022-05-19 13:37:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:37:20] [INFO ] Computed 178 place invariants in 36 ms
[2022-05-19 13:37:24] [INFO ] Dead Transitions using invariants and state equation in 3772 ms found 0 transitions.
[2022-05-19 13:37:24] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:37:24] [INFO ] Computed 178 place invariants in 28 ms
[2022-05-19 13:37:27] [INFO ] Implicit Places using invariants in 2736 ms returned []
[2022-05-19 13:37:27] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:37:27] [INFO ] Computed 178 place invariants in 34 ms
[2022-05-19 13:37:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:37:58] [INFO ] Performed 487/1184 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:38:28] [INFO ] Performed 1139/1184 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:38:29] [INFO ] Implicit Places using invariants and state equation in 62233 ms returned []
Implicit Place search using SMT with State Equation took 64972 ms to find 0 implicit places.
[2022-05-19 13:38:29] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:38:29] [INFO ] Computed 178 place invariants in 32 ms
[2022-05-19 13:38:33] [INFO ] Dead Transitions using invariants and state equation in 3836 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1184/1184 places, 1599/1599 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 703 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Finished Best-First random walk after 2313 steps, including 7 resets, run visited all 1 properties in 4 ms. (steps per millisecond=578 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20097 reset in 655 ms.
Product exploration explored 100000 steps with 20130 reset in 683 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1599/1599 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1184 transition count 1599
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 84 place count 1184 transition count 1600
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1183 transition count 1599
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1183 transition count 1599
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 173 place count 1183 transition count 1599
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 257 place count 1099 transition count 1515
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 341 place count 1099 transition count 1515
Deduced a syphon composed of 86 places in 1 ms
Applied a total of 341 rules in 167 ms. Remains 1099 /1184 variables (removed 85) and now considering 1515/1599 (removed 84) transitions.
[2022-05-19 13:38:35] [INFO ] Flow matrix only has 1511 transitions (discarded 4 similar events)
// Phase 1: matrix 1511 rows 1099 cols
[2022-05-19 13:38:35] [INFO ] Computed 178 place invariants in 33 ms
[2022-05-19 13:38:37] [INFO ] Dead Transitions using invariants and state equation in 1605 ms found 0 transitions.
[2022-05-19 13:38:37] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-19 13:38:37] [INFO ] Flow matrix only has 1511 transitions (discarded 4 similar events)
// Phase 1: matrix 1511 rows 1099 cols
[2022-05-19 13:38:37] [INFO ] Computed 178 place invariants in 27 ms
[2022-05-19 13:38:39] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1099/1184 places, 1515/1599 transitions.
Finished structural reductions, in 1 iterations. Remains : 1099/1184 places, 1515/1599 transitions.
Product exploration explored 100000 steps with 22508 reset in 4192 ms.
Product exploration explored 100000 steps with 22500 reset in 4186 ms.
Built C files in :
/tmp/ltsmin4247750339160973467
[2022-05-19 13:38:47] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4247750339160973467
Running compilation step : cd /tmp/ltsmin4247750339160973467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4247750339160973467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4247750339160973467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1599/1599 transitions.
Applied a total of 0 rules in 34 ms. Remains 1184 /1184 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2022-05-19 13:38:50] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:38:50] [INFO ] Computed 178 place invariants in 34 ms
[2022-05-19 13:38:54] [INFO ] Dead Transitions using invariants and state equation in 3780 ms found 0 transitions.
[2022-05-19 13:38:54] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:38:54] [INFO ] Computed 178 place invariants in 28 ms
[2022-05-19 13:38:57] [INFO ] Implicit Places using invariants in 2757 ms returned []
[2022-05-19 13:38:57] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:38:57] [INFO ] Computed 178 place invariants in 32 ms
[2022-05-19 13:38:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:39:27] [INFO ] Performed 477/1184 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:39:58] [INFO ] Performed 1139/1184 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:39:58] [INFO ] Implicit Places using invariants and state equation in 61719 ms returned []
Implicit Place search using SMT with State Equation took 64478 ms to find 0 implicit places.
[2022-05-19 13:39:58] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1184 cols
[2022-05-19 13:39:58] [INFO ] Computed 178 place invariants in 35 ms
[2022-05-19 13:40:02] [INFO ] Dead Transitions using invariants and state equation in 3728 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1184/1184 places, 1599/1599 transitions.
Built C files in :
/tmp/ltsmin1924331735268481540
[2022-05-19 13:40:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1924331735268481540
Running compilation step : cd /tmp/ltsmin1924331735268481540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1924331735268481540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1924331735268481540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 13:40:05] [INFO ] Flatten gal took : 61 ms
[2022-05-19 13:40:05] [INFO ] Flatten gal took : 60 ms
[2022-05-19 13:40:06] [INFO ] Time to serialize gal into /tmp/LTL6648515201517416385.gal : 279 ms
[2022-05-19 13:40:06] [INFO ] Time to serialize properties into /tmp/LTL5652535583189617274.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6648515201517416385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5652535583189617274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6648515...266
Read 1 LTL properties
Checking formula 0 : !(((G("(place_521_1<2)"))||(F(X("((place_521_1<2)&&(((cSources<1)||(DataOnSrc_2<1))||((CanInjectEvent<1)||(TheSour_2<1))))")))))
Formula 0 simplified : !(G"(place_521_1<2)" | FX"((place_521_1<2)&&(((cSources<1)||(DataOnSrc_2<1))||((CanInjectEvent<1)||(TheSour_2<1))))")
Detected timeout of ITS tools.
[2022-05-19 13:40:21] [INFO ] Flatten gal took : 62 ms
[2022-05-19 13:40:21] [INFO ] Applying decomposition
[2022-05-19 13:40:21] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5028531770000016134.txt' '-o' '/tmp/graph5028531770000016134.bin' '-w' '/tmp/graph5028531770000016134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5028531770000016134.bin' '-l' '-1' '-v' '-w' '/tmp/graph5028531770000016134.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:40:21] [INFO ] Decomposing Gal with order
[2022-05-19 13:40:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:40:21] [INFO ] Removed a total of 1839 redundant transitions.
[2022-05-19 13:40:21] [INFO ] Flatten gal took : 232 ms
[2022-05-19 13:40:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 531 labels/synchronizations in 29 ms.
[2022-05-19 13:40:21] [INFO ] Time to serialize gal into /tmp/LTL9269579276954972163.gal : 10 ms
[2022-05-19 13:40:21] [INFO ] Time to serialize properties into /tmp/LTL5589514210695580197.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9269579276954972163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5589514210695580197.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9269579...245
Read 1 LTL properties
Checking formula 0 : !(((G("(i53.u146.place_521_1<2)"))||(F(X("((i53.u146.place_521_1<2)&&(((i53.u146.cSources<1)||(i23.i8.u147.DataOnSrc_2<1))||((i53.u146...208
Formula 0 simplified : !(G"(i53.u146.place_521_1<2)" | FX"((i53.u146.place_521_1<2)&&(((i53.u146.cSources<1)||(i23.i8.u147.DataOnSrc_2<1))||((i53.u146.CanI...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17224670800781756005
[2022-05-19 13:40:36] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17224670800781756005
Running compilation step : cd /tmp/ltsmin17224670800781756005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17224670800781756005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17224670800781756005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-15 finished in 262130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(X(p0) U p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(X(p0)) U X((G(p2)||p1)))))'
Found a CL insensitive property : PolyORBNT-PT-S05J80-LTLFireability-03
Stuttering acceptance computed with spot in 155 ms :[(OR p1 p2), (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p2]
Support contains 8 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1184 transition count 1516
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1100 transition count 1516
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1100 transition count 1432
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1016 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1015 transition count 1431
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1015 transition count 1431
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 2 with 2 rules applied. Total rules applied 340 place count 1014 transition count 1430
Applied a total of 340 rules in 117 ms. Remains 1014 /1185 variables (removed 171) and now considering 1430/1600 (removed 170) transitions.
[2022-05-19 13:40:40] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:40:40] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:40:42] [INFO ] Dead Transitions using invariants and state equation in 2042 ms found 0 transitions.
[2022-05-19 13:40:42] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:40:42] [INFO ] Computed 177 place invariants in 25 ms
[2022-05-19 13:40:44] [INFO ] Implicit Places using invariants in 2440 ms returned []
[2022-05-19 13:40:44] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:40:44] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:41:15] [INFO ] Performed 537/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:41:41] [INFO ] Implicit Places using invariants and state equation in 56295 ms returned []
Implicit Place search using SMT with State Equation took 58736 ms to find 0 implicit places.
[2022-05-19 13:41:41] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:41:41] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:41:43] [INFO ] Dead Transitions using invariants and state equation in 2063 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1014/1185 places, 1430/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1014/1185 places, 1430/1600 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s739 1), p1:(OR (AND (GEQ s485 6) (GEQ s898 1) (GEQ s922 1) (GEQ s936 3)) (AND (GEQ s485 6) (GEQ s806 3) (GEQ s898 1) (GEQ s922 1)) (AND (GEQ s485...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5547 reset in 1505 ms.
Product exploration explored 100000 steps with 5574 reset in 1554 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 561 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR p1 p2), (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p2]
Incomplete random walk after 10000 steps, including 550 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-19 13:41:47] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:41:47] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:41:47] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2022-05-19 13:41:47] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 44 ms returned sat
[2022-05-19 13:41:47] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-19 13:41:47] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2022-05-19 13:41:47] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 47 ms returned sat
[2022-05-19 13:41:47] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p1), (F p2)]
Knowledge based reduction with 11 factoid took 1212 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 129 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 21 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2022-05-19 13:41:49] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:41:49] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:41:51] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
[2022-05-19 13:41:51] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:41:51] [INFO ] Computed 177 place invariants in 27 ms
[2022-05-19 13:41:53] [INFO ] Implicit Places using invariants in 2498 ms returned []
[2022-05-19 13:41:53] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:41:53] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-19 13:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:42:24] [INFO ] Performed 545/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:42:50] [INFO ] Implicit Places using invariants and state equation in 56753 ms returned []
Implicit Place search using SMT with State Equation took 59252 ms to find 0 implicit places.
[2022-05-19 13:42:50] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:42:50] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:42:52] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1014/1014 places, 1430/1430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 1605 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Finished random walk after 1180 steps, including 68 resets, run visited all 6 properties in 24 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p0 (NOT p2)))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 6 factoid took 563 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 152 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 139 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 5521 reset in 1412 ms.
Product exploration explored 100000 steps with 5578 reset in 1462 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 162 ms :[(OR p1 (AND (NOT p0) p2)), (OR p1 (AND (NOT p0) p2)), (AND p0 p1 (NOT p2)), (AND (NOT p0) p2)]
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 48 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2022-05-19 13:42:58] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:42:58] [INFO ] Computed 177 place invariants in 44 ms
[2022-05-19 13:43:00] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
[2022-05-19 13:43:00] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-19 13:43:00] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:43:00] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:43:02] [INFO ] Dead Transitions using invariants and state equation in 2009 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1014/1014 places, 1430/1430 transitions.
Product exploration explored 100000 steps with 5519 reset in 1455 ms.
Product exploration explored 100000 steps with 5478 reset in 1503 ms.
Built C files in :
/tmp/ltsmin17556996435077539358
[2022-05-19 13:43:05] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17556996435077539358
Running compilation step : cd /tmp/ltsmin17556996435077539358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17556996435077539358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17556996435077539358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 28 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2022-05-19 13:43:08] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:43:08] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:43:10] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
[2022-05-19 13:43:10] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:43:10] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:43:13] [INFO ] Implicit Places using invariants in 2451 ms returned []
[2022-05-19 13:43:13] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:43:13] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-19 13:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:43:44] [INFO ] Performed 579/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:44:14] [INFO ] Performed 884/1014 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:44:20] [INFO ] Implicit Places using invariants and state equation in 67572 ms returned []
Implicit Place search using SMT with State Equation took 70025 ms to find 0 implicit places.
[2022-05-19 13:44:20] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2022-05-19 13:44:20] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-19 13:44:22] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1014/1014 places, 1430/1430 transitions.
Built C files in :
/tmp/ltsmin9612555507449612230
[2022-05-19 13:44:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9612555507449612230
Running compilation step : cd /tmp/ltsmin9612555507449612230;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2825 ms.
Running link step : cd /tmp/ltsmin9612555507449612230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9612555507449612230;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5768645614316391262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:44:37] [INFO ] Flatten gal took : 62 ms
[2022-05-19 13:44:38] [INFO ] Flatten gal took : 61 ms
[2022-05-19 13:44:38] [INFO ] Time to serialize gal into /tmp/LTL822504476525528403.gal : 6 ms
[2022-05-19 13:44:38] [INFO ] Time to serialize properties into /tmp/LTL258112738430671944.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL822504476525528403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL258112738430671944.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8225044...264
Read 1 LTL properties
Checking formula 0 : !((F(!((F(X("(Schedule_Task_B_1>=1)")))U(X((((((((G("((((((cSources>=9)&&(ModifiedSrc_4>=1))&&(place_500_1>=1))||(((cSources>=9)&&(Mod...6834
Formula 0 simplified : !F!(FX"(Schedule_Task_B_1>=1)" U X("((((((((cSources>=6)&&(ModifiedSrc_2>=1))&&((place_500_1>=1)&&(ModifiedSrc_5>=3)))||((((cSources...6801
Detected timeout of ITS tools.
[2022-05-19 13:44:53] [INFO ] Flatten gal took : 60 ms
[2022-05-19 13:44:53] [INFO ] Applying decomposition
[2022-05-19 13:44:53] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4581334156728476795.txt' '-o' '/tmp/graph4581334156728476795.bin' '-w' '/tmp/graph4581334156728476795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4581334156728476795.bin' '-l' '-1' '-v' '-w' '/tmp/graph4581334156728476795.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:44:53] [INFO ] Decomposing Gal with order
[2022-05-19 13:44:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:44:53] [INFO ] Removed a total of 1457 redundant transitions.
[2022-05-19 13:44:53] [INFO ] Flatten gal took : 150 ms
[2022-05-19 13:44:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 517 labels/synchronizations in 20 ms.
[2022-05-19 13:44:53] [INFO ] Time to serialize gal into /tmp/LTL7226755356856771510.gal : 9 ms
[2022-05-19 13:44:53] [INFO ] Time to serialize properties into /tmp/LTL8777374972511718824.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7226755356856771510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8777374972511718824.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7226755...245
Read 1 LTL properties
Checking formula 0 : !((F(!((F(X("(i26.u64.Schedule_Task_B_1>=1)")))U(X((((((((G("((((((i21.u39.cSources>=9)&&(i21.u39.ModifiedSrc_4>=1))&&(i21.u39.place_5...9482
Formula 0 simplified : !F!(FX"(i26.u64.Schedule_Task_B_1>=1)" U X("((((((((i21.u39.cSources>=6)&&(i21.u39.ModifiedSrc_2>=1))&&((i21.u39.place_500_1>=1)&&(i...9449
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11151263193412785063
[2022-05-19 13:45:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11151263193412785063
Running compilation step : cd /tmp/ltsmin11151263193412785063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11151263193412785063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11151263193412785063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-03 finished in 271722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(X(X(X(!F(p0))))) U !p0)))))'
Found a SL insensitive property : PolyORBNT-PT-S05J80-LTLFireability-14
Stuttering acceptance computed with spot in 164 ms :[true, p0, p0, p0, p0, p0, p0]
Support contains 1 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1184 transition count 1515
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1099 transition count 1515
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 170 place count 1099 transition count 1431
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 338 place count 1015 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 1014 transition count 1430
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 1014 transition count 1430
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 1012 transition count 1428
Applied a total of 344 rules in 111 ms. Remains 1012 /1185 variables (removed 173) and now considering 1428/1600 (removed 172) transitions.
[2022-05-19 13:45:12] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:45:12] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:45:14] [INFO ] Dead Transitions using invariants and state equation in 1958 ms found 0 transitions.
[2022-05-19 13:45:14] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:45:14] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-19 13:45:16] [INFO ] Implicit Places using invariants in 2318 ms returned []
[2022-05-19 13:45:16] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:45:16] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:45:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:45:46] [INFO ] Implicit Places using invariants and state equation in 29217 ms returned []
Implicit Place search using SMT with State Equation took 31537 ms to find 0 implicit places.
[2022-05-19 13:45:46] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:45:46] [INFO ] Computed 177 place invariants in 40 ms
[2022-05-19 13:45:48] [INFO ] Dead Transitions using invariants and state equation in 1984 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1012/1185 places, 1428/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1185 places, 1428/1600 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(GEQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5305 reset in 878 ms.
Product exploration explored 100000 steps with 5296 reset in 907 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 177 ms :[true, p0, p0, p0, p0, p0, p0]
Finished random walk after 531 steps, including 23 resets, run visited all 1 properties in 8 ms. (steps per millisecond=66 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 431 ms :[true, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 199 ms :[true, p0, p0, p0, p0, p0, p0]
Support contains 1 out of 1012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1012/1012 places, 1428/1428 transitions.
Applied a total of 0 rules in 23 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2022-05-19 13:45:51] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:45:51] [INFO ] Computed 177 place invariants in 29 ms
[2022-05-19 13:45:53] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
[2022-05-19 13:45:53] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:45:53] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:45:55] [INFO ] Implicit Places using invariants in 2320 ms returned []
[2022-05-19 13:45:55] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:45:55] [INFO ] Computed 177 place invariants in 29 ms
[2022-05-19 13:45:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:46:21] [INFO ] Implicit Places using invariants and state equation in 26365 ms returned []
Implicit Place search using SMT with State Equation took 28687 ms to find 0 implicit places.
[2022-05-19 13:46:21] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:46:21] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:46:23] [INFO ] Dead Transitions using invariants and state equation in 2008 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 1428/1428 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 204 ms :[true, p0, p0, p0, p0, p0, p0]
Finished random walk after 383 steps, including 20 resets, run visited all 1 properties in 8 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 7 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 195 ms :[true, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 195 ms :[true, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 195 ms :[true, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 5327 reset in 904 ms.
Product exploration explored 100000 steps with 5312 reset in 909 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[true, p0, p0, p0, p0, p0, p0]
Support contains 1 out of 1012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1012/1012 places, 1428/1428 transitions.
Applied a total of 0 rules in 40 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2022-05-19 13:46:26] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:46:27] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:46:28] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
[2022-05-19 13:46:28] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-19 13:46:28] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:46:29] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-19 13:46:30] [INFO ] Dead Transitions using invariants and state equation in 1976 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 1428/1428 transitions.
Product exploration explored 100000 steps with 5302 reset in 898 ms.
Product exploration explored 100000 steps with 5336 reset in 931 ms.
Built C files in :
/tmp/ltsmin13865858706222995392
[2022-05-19 13:46:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13865858706222995392
Running compilation step : cd /tmp/ltsmin13865858706222995392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13865858706222995392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13865858706222995392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1012/1012 places, 1428/1428 transitions.
Applied a total of 0 rules in 23 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2022-05-19 13:46:35] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:46:35] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-19 13:46:37] [INFO ] Dead Transitions using invariants and state equation in 1953 ms found 0 transitions.
[2022-05-19 13:46:37] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:46:37] [INFO ] Computed 177 place invariants in 28 ms
[2022-05-19 13:46:40] [INFO ] Implicit Places using invariants in 2316 ms returned []
[2022-05-19 13:46:40] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:46:40] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-19 13:46:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:47:10] [INFO ] Performed 692/1012 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:47:21] [INFO ] Implicit Places using invariants and state equation in 41686 ms returned []
Implicit Place search using SMT with State Equation took 44003 ms to find 0 implicit places.
[2022-05-19 13:47:21] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2022-05-19 13:47:21] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-19 13:47:23] [INFO ] Dead Transitions using invariants and state equation in 1941 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 1428/1428 transitions.
Built C files in :
/tmp/ltsmin10003424400885643344
[2022-05-19 13:47:23] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10003424400885643344
Running compilation step : cd /tmp/ltsmin10003424400885643344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2659 ms.
Running link step : cd /tmp/ltsmin10003424400885643344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10003424400885643344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6055323068360706943.hoa' '--buchi-type=spotba'
LTSmin run took 998 ms.
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-14 finished in 135794 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-14 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(X(p1))))'
Found a CL insensitive property : PolyORBNT-PT-S05J80-LTLFireability-15
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1185/1185 places, 1600/1600 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1185 transition count 1515
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1100 transition count 1515
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1100 transition count 1430
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1015 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1014 transition count 1429
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1014 transition count 1429
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 2 with 2 rules applied. Total rules applied 344 place count 1013 transition count 1428
Applied a total of 344 rules in 115 ms. Remains 1013 /1185 variables (removed 172) and now considering 1428/1600 (removed 172) transitions.
[2022-05-19 13:47:27] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:47:27] [INFO ] Computed 178 place invariants in 30 ms
[2022-05-19 13:47:29] [INFO ] Dead Transitions using invariants and state equation in 1973 ms found 0 transitions.
[2022-05-19 13:47:29] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:47:29] [INFO ] Computed 178 place invariants in 33 ms
[2022-05-19 13:47:32] [INFO ] Implicit Places using invariants in 2520 ms returned []
[2022-05-19 13:47:32] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:47:32] [INFO ] Computed 178 place invariants in 32 ms
[2022-05-19 13:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:48:03] [INFO ] Performed 393/1013 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:48:33] [INFO ] Performed 934/1013 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:48:37] [INFO ] Implicit Places using invariants and state equation in 65086 ms returned []
Implicit Place search using SMT with State Equation took 67610 ms to find 0 implicit places.
[2022-05-19 13:48:37] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:48:37] [INFO ] Computed 178 place invariants in 33 ms
[2022-05-19 13:48:39] [INFO ] Dead Transitions using invariants and state equation in 2054 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1013/1185 places, 1428/1600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1013/1185 places, 1428/1600 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (LT s179 2) (OR (LT s485 1) (LT s567 1) (LT s715 1) (LT s883 1))), p0:(LT s179 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23127 reset in 651 ms.
Product exploration explored 100000 steps with 23120 reset in 677 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 75 steps, including 4 resets, run visited all 3 properties in 3 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1013 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1428/1428 transitions.
Applied a total of 0 rules in 24 ms. Remains 1013 /1013 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2022-05-19 13:48:41] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:48:41] [INFO ] Computed 178 place invariants in 34 ms
[2022-05-19 13:48:43] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
[2022-05-19 13:48:43] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:48:43] [INFO ] Computed 178 place invariants in 35 ms
[2022-05-19 13:48:46] [INFO ] Implicit Places using invariants in 2560 ms returned []
[2022-05-19 13:48:46] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:48:46] [INFO ] Computed 178 place invariants in 31 ms
[2022-05-19 13:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:49:16] [INFO ] Performed 416/1013 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 13:49:47] [INFO ] Performed 999/1013 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-19 13:49:48] [INFO ] Implicit Places using invariants and state equation in 62011 ms returned []
Implicit Place search using SMT with State Equation took 64574 ms to find 0 implicit places.
[2022-05-19 13:49:48] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:49:48] [INFO ] Computed 178 place invariants in 29 ms
[2022-05-19 13:49:50] [INFO ] Dead Transitions using invariants and state equation in 2006 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1013/1013 places, 1428/1428 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 255 steps, including 14 resets, run visited all 3 properties in 4 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 23067 reset in 653 ms.
Product exploration explored 100000 steps with 23148 reset in 678 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1013 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1013/1013 places, 1428/1428 transitions.
Applied a total of 0 rules in 43 ms. Remains 1013 /1013 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2022-05-19 13:49:52] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:49:52] [INFO ] Computed 178 place invariants in 36 ms
[2022-05-19 13:49:54] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
[2022-05-19 13:49:54] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 13:49:54] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1013 cols
[2022-05-19 13:49:54] [INFO ] Computed 178 place invariants in 26 ms
[2022-05-19 13:49:56] [INFO ] Dead Transitions using invariants and state equation in 1910 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1013/1013 places, 1428/1428 transitions.
Product exploration explored 100000 steps with 23120 reset in 3779 ms.
Product exploration explored 100000 steps with 23109 reset in 3680 ms.
Built C files in :
/tmp/ltsmin1834973056358581683
[2022-05-19 13:50:04] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1834973056358581683
Running compilation step : cd /tmp/ltsmin1834973056358581683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2700 ms.
Running link step : cd /tmp/ltsmin1834973056358581683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1834973056358581683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10993666503997514345.hoa' '--buchi-type=spotba'
LTSmin run took 347 ms.
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-15 finished in 159700 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-15 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-19 13:50:07] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12203965169757917580
[2022-05-19 13:50:07] [INFO ] Too many transitions (1600) to apply POR reductions. Disabling POR matrices.
[2022-05-19 13:50:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12203965169757917580
Running compilation step : cd /tmp/ltsmin12203965169757917580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 13:50:07] [INFO ] Applying decomposition
[2022-05-19 13:50:07] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17531210424766366260.txt' '-o' '/tmp/graph17531210424766366260.bin' '-w' '/tmp/graph17531210424766366260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17531210424766366260.bin' '-l' '-1' '-v' '-w' '/tmp/graph17531210424766366260.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:50:07] [INFO ] Decomposing Gal with order
[2022-05-19 13:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:50:07] [INFO ] Removed a total of 1839 redundant transitions.
[2022-05-19 13:50:07] [INFO ] Flatten gal took : 251 ms
[2022-05-19 13:50:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 531 labels/synchronizations in 27 ms.
[2022-05-19 13:50:07] [INFO ] Time to serialize gal into /tmp/LTLFireability7688230439591618554.gal : 14 ms
[2022-05-19 13:50:07] [INFO ] Time to serialize properties into /tmp/LTLFireability96411547416318560.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7688230439591618554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability96411547416318560.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...265
Read 2 LTL properties
Checking formula 0 : !((F(G(!((X("((((((((((((((((((i32.u96.mi2>=1)&&(i32.u96.QueueJobB_1_60>=1))&&(i32.u124.block>=1))||(((i32.u96.QueueJobB_1_24>=1)&&(i3...40563
Formula 0 simplified : !FG!(X"((((((((((((((((((i32.u96.mi2>=1)&&(i32.u96.QueueJobB_1_60>=1))&&(i32.u124.block>=1))||(((i32.u96.QueueJobB_1_24>=1)&&(i32.u9...40553
Compilation finished in 3909 ms.
Running link step : cd /tmp/ltsmin12203965169757917580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12203965169757917580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](!(X((LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J80"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J80, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017300844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 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 ;