About the Execution of ITS-Tools for PolyORBNT-COL-S10J80
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16218.088 | 3600000.00 | 12408317.00 | 11757.50 | ?TTFFF?FTFFFF?TT | 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-165277017200804.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-COL-S10J80, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200804
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.6K Apr 30 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 04:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 04:02 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 4.1K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 95K 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-COL-S10J80-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652954134783
Running Version 202205111006
[2022-05-19 09:55:35] [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 09:55:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 09:55:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 09:55:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 09:55:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 636 ms
[2022-05-19 09:55:36] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 09:55:36] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 10 ms.
[2022-05-19 09:55:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 571 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 09:55:37] [INFO ] Computed 13 place invariants in 10 ms
[2022-05-19 09:55:37] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2022-05-19 09:55:37] [INFO ] Flatten gal took : 22 ms
[2022-05-19 09:55:37] [INFO ] Flatten gal took : 9 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 09:55:38] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 204 ms.
[2022-05-19 09:55:38] [INFO ] Unfolded 13 HLPN properties in 9 ms.
Initial state reduction rules removed 1 formulas.
[2022-05-19 09:55:38] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-19 09:55:38] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-19 09:55:38] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 80 places in 34 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1259 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 3390
Applied a total of 10 rules in 112 ms. Remains 1604 /1614 variables (removed 10) and now considering 3390/3390 (removed 0) transitions.
[2022-05-19 09:55:38] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1604 cols
[2022-05-19 09:55:38] [INFO ] Computed 182 place invariants in 366 ms
[2022-05-19 09:55:41] [INFO ] Dead Transitions using invariants and state equation in 3365 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 09:55:41] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 09:55:42] [INFO ] Computed 182 place invariants in 122 ms
[2022-05-19 09:55:42] [INFO ] Implicit Places using invariants in 547 ms returned []
[2022-05-19 09:55:42] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 09:55:42] [INFO ] Computed 182 place invariants in 89 ms
[2022-05-19 09:55:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:55:44] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1614 places, 2775/3390 transitions.
Applied a total of 0 rules in 50 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1604/1614 places, 2775/3390 transitions.
Support contains 1259 out of 1604 places after structural reductions.
[2022-05-19 09:55:44] [INFO ] Flatten gal took : 258 ms
[2022-05-19 09:55:45] [INFO ] Flatten gal took : 206 ms
[2022-05-19 09:55:45] [INFO ] Input system was already deterministic with 2775 transitions.
Incomplete random walk after 10000 steps, including 557 resets, run finished after 1518 ms. (steps per millisecond=6 ) properties (out of 21) seen :18
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 1753 ms. (steps per millisecond=5 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-19 09:55:49] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 09:55:49] [INFO ] Computed 182 place invariants in 68 ms
[2022-05-19 09:55:52] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(X(G(p0)))))))'
Support contains 84 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 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 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1519 transition count 2690
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 1519 transition count 2605
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 1434 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1433 transition count 2604
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1433 transition count 2604
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 1432 transition count 2603
Applied a total of 344 rules in 718 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2022-05-19 09:55:54] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:55:54] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 09:55:55] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
[2022-05-19 09:55:55] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:55:55] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 09:55:57] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2022-05-19 09:55:57] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:55:57] [INFO ] Computed 182 place invariants in 63 ms
[2022-05-19 09:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:56:06] [INFO ] Implicit Places using invariants and state equation in 8923 ms returned []
Implicit Place search using SMT with State Equation took 10307 ms to find 0 implicit places.
[2022-05-19 09:56:06] [INFO ] Redundant transitions in 149 ms returned []
[2022-05-19 09:56:06] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:06] [INFO ] Computed 182 place invariants in 64 ms
[2022-05-19 09:56:07] [INFO ] Dead Transitions using invariants and state equation in 1524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-00 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 (GEQ s1429 1) (AND (LT s1429 1) (OR (LT s0 1) (LT s127 1) (LT s411 1)) (OR (LT s0 1) (LT s137 1) (LT s411 1)) (OR (LT s0 1) (LT s156 1) (LT s411 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 7306 reset in 1980 ms.
Product exploration explored 100000 steps with 7350 reset in 1830 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 : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 101 steps, including 7 resets, run visited all 1 properties in 4 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 84 out of 1432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1432/1432 places, 2603/2603 transitions.
Applied a total of 0 rules in 105 ms. Remains 1432 /1432 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2022-05-19 09:56:12] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:12] [INFO ] Computed 182 place invariants in 77 ms
[2022-05-19 09:56:13] [INFO ] Dead Transitions using invariants and state equation in 1445 ms found 0 transitions.
[2022-05-19 09:56:13] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:13] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-19 09:56:14] [INFO ] Implicit Places using invariants in 1328 ms returned []
[2022-05-19 09:56:14] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:15] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 09:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:56:22] [INFO ] Implicit Places using invariants and state equation in 8033 ms returned []
Implicit Place search using SMT with State Equation took 9363 ms to find 0 implicit places.
[2022-05-19 09:56:23] [INFO ] Redundant transitions in 118 ms returned []
[2022-05-19 09:56:23] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:23] [INFO ] Computed 182 place invariants in 64 ms
[2022-05-19 09:56:24] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1432/1432 places, 2603/2603 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 :[(NOT p0)]
Finished random walk after 1196 steps, including 90 resets, run visited all 1 properties in 22 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 454 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7265 reset in 1907 ms.
Product exploration explored 100000 steps with 7298 reset in 1950 ms.
Built C files in :
/tmp/ltsmin12251029536993134298
[2022-05-19 09:56:29] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:56:29] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12251029536993134298
Running compilation step : cd /tmp/ltsmin12251029536993134298;'/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/ltsmin12251029536993134298;'/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/ltsmin12251029536993134298;'/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 84 out of 1432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1432/1432 places, 2603/2603 transitions.
Applied a total of 0 rules in 87 ms. Remains 1432 /1432 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2022-05-19 09:56:32] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:32] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 09:56:33] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
[2022-05-19 09:56:33] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:33] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 09:56:35] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2022-05-19 09:56:35] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:35] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 09:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:56:44] [INFO ] Implicit Places using invariants and state equation in 9642 ms returned []
Implicit Place search using SMT with State Equation took 10931 ms to find 0 implicit places.
[2022-05-19 09:56:44] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-19 09:56:44] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2022-05-19 09:56:44] [INFO ] Computed 182 place invariants in 53 ms
[2022-05-19 09:56:46] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1432/1432 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin2169500340628882133
[2022-05-19 09:56:46] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:56:46] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2169500340628882133
Running compilation step : cd /tmp/ltsmin2169500340628882133;'/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/ltsmin2169500340628882133;'/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/ltsmin2169500340628882133;'/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 09:56:49] [INFO ] Flatten gal took : 123 ms
[2022-05-19 09:56:49] [INFO ] Flatten gal took : 123 ms
[2022-05-19 09:56:49] [INFO ] Time to serialize gal into /tmp/LTL18413909535642400065.gal : 31 ms
[2022-05-19 09:56:49] [INFO ] Time to serialize properties into /tmp/LTL11170838819850956504.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/LTL18413909535642400065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11170838819850956504.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/LTL1841390...268
Read 1 LTL properties
Checking formula 0 : !((F(X(X(F(X(G("((Schedule_Task_B_0>=1)||((((((((Schedule_Task_B_0<1)&&(((block_0<1)||(QueueJobB_43<1))||(mi3_0<1)))&&((((block_0<1)||...3971
Formula 0 simplified : !FXXFXG"((Schedule_Task_B_0>=1)||((((((((Schedule_Task_B_0<1)&&(((block_0<1)||(QueueJobB_43<1))||(mi3_0<1)))&&((((block_0<1)||(Queue...3957
Detected timeout of ITS tools.
[2022-05-19 09:57:05] [INFO ] Flatten gal took : 122 ms
[2022-05-19 09:57:05] [INFO ] Applying decomposition
[2022-05-19 09:57:05] [INFO ] Flatten gal took : 123 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/graph14107803008487663671.txt' '-o' '/tmp/graph14107803008487663671.bin' '-w' '/tmp/graph14107803008487663671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14107803008487663671.bin' '-l' '-1' '-v' '-w' '/tmp/graph14107803008487663671.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:57:05] [INFO ] Decomposing Gal with order
[2022-05-19 09:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:57:06] [INFO ] Removed a total of 4720 redundant transitions.
[2022-05-19 09:57:06] [INFO ] Flatten gal took : 581 ms
[2022-05-19 09:57:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 705 labels/synchronizations in 126 ms.
[2022-05-19 09:57:06] [INFO ] Time to serialize gal into /tmp/LTL9206838537893975821.gal : 24 ms
[2022-05-19 09:57:06] [INFO ] Time to serialize properties into /tmp/LTL5319515838747603325.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/LTL9206838537893975821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5319515838747603325.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/LTL9206838...245
Read 1 LTL properties
Checking formula 0 : !((F(X(X(F(X(G("((i25.u95.Schedule_Task_B_0>=1)||((((((((i25.u95.Schedule_Task_B_0<1)&&(((i0.u0.block_0<1)||(i0.u1.QueueJobB_43<1))||(...5445
Formula 0 simplified : !FXXFXG"((i25.u95.Schedule_Task_B_0>=1)||((((((((i25.u95.Schedule_Task_B_0<1)&&(((i0.u0.block_0<1)||(i0.u1.QueueJobB_43<1))||(i0.u1....5431
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8543693069559545226
[2022-05-19 09:57:21] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8543693069559545226
Running compilation step : cd /tmp/ltsmin8543693069559545226;'/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/ltsmin8543693069559545226;'/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/ltsmin8543693069559545226;'/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-COL-S10J80-LTLFireability-00 finished in 91797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&!(p1 U p2)))))'
Support contains 88 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 92 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2022-05-19 09:57:24] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:57:24] [INFO ] Computed 182 place invariants in 63 ms
[2022-05-19 09:57:27] [INFO ] Dead Transitions using invariants and state equation in 2383 ms found 0 transitions.
[2022-05-19 09:57:27] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:57:27] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 09:57:28] [INFO ] Implicit Places using invariants in 1423 ms returned []
[2022-05-19 09:57:28] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:57:28] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 09:57:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:57:45] [INFO ] Implicit Places using invariants and state equation in 16709 ms returned []
Implicit Place search using SMT with State Equation took 18135 ms to find 0 implicit places.
[2022-05-19 09:57:45] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:57:45] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 09:57:47] [INFO ] Dead Transitions using invariants and state equation in 2466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), p2]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s88 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s137 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s147 1) (GEQ s413 1)) (AND (GEQ s0 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1940 ms.
Product exploration explored 100000 steps with 33333 reset in 1940 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) p0)
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-02 finished in 27479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(!p1) U (G(X(p2))&&p1)))))'
Support contains 257 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 85 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2022-05-19 09:57:52] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:57:52] [INFO ] Computed 182 place invariants in 68 ms
[2022-05-19 09:57:54] [INFO ] Dead Transitions using invariants and state equation in 2514 ms found 0 transitions.
[2022-05-19 09:57:54] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:57:54] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 09:57:56] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2022-05-19 09:57:56] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:57:56] [INFO ] Computed 182 place invariants in 55 ms
[2022-05-19 09:57:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:58:10] [INFO ] Implicit Places using invariants and state equation in 13970 ms returned []
Implicit Place search using SMT with State Equation took 15299 ms to find 0 implicit places.
[2022-05-19 09:58:10] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:58:10] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 09:58:12] [INFO ] Dead Transitions using invariants and state equation in 2338 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s132 1) (GEQ s412 1)) (AND (GEQ s0 1) (GEQ s93 1) (GEQ s412 1)) (AND (GEQ s0 1) (GEQ s103 1) (GEQ s412 1)) (AND (GEQ s0 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-03 finished in 20458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(p1)))||X((!X(p2) U G(p2)))))'
Support contains 85 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 93 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2022-05-19 09:58:12] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:58:12] [INFO ] Computed 182 place invariants in 53 ms
[2022-05-19 09:58:15] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
[2022-05-19 09:58:15] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:58:15] [INFO ] Computed 182 place invariants in 55 ms
[2022-05-19 09:58:16] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2022-05-19 09:58:16] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:58:16] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 09:58:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:58:26] [INFO ] Implicit Places using invariants and state equation in 10335 ms returned []
Implicit Place search using SMT with State Equation took 11790 ms to find 0 implicit places.
[2022-05-19 09:58:26] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 09:58:26] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 09:58:29] [INFO ] Dead Transitions using invariants and state equation in 2383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 599 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p2), false, p2, (NOT p2), false, true, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), false, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 9}, { cond=(AND p2 p1), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 12}], [{ cond=p2, acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}, { cond=p2, acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={} source=7 dest: 13}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=9 dest: 11}, { cond=(AND p2 p1), acceptance={} source=9 dest: 14}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 13}, { cond=(AND p2 p1), acceptance={} source=10 dest: 15}], [{ cond=(NOT p0), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}], [{ cond=(NOT p2), acceptance={} source=13 dest: 8}], [{ cond=(NOT p1), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 11}, { cond=p1, acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=15 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p2) p1), acceptance={} source=15 dest: 14}]], initial=0, aps=[p0:(GEQ s500 2), p2:(OR (AND (GEQ s0 1) (GEQ s88 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s137 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s147 1) (GEQ s413 1)) (A...], 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32821 steps with 8156 reset in 731 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-05 finished in 17948 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((F(p0) U p0)||p1))&&p1)))'
Support contains 82 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1604 transition count 2770
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1599 transition count 2770
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 1599 transition count 2767
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 16 place count 1596 transition count 2767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1595 transition count 2766
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1595 transition count 2766
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 22 place count 1593 transition count 2764
Applied a total of 22 rules in 216 ms. Remains 1593 /1604 variables (removed 11) and now considering 2764/2775 (removed 11) transitions.
[2022-05-19 09:58:30] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:58:30] [INFO ] Computed 182 place invariants in 53 ms
[2022-05-19 09:58:33] [INFO ] Dead Transitions using invariants and state equation in 2307 ms found 0 transitions.
[2022-05-19 09:58:33] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:58:33] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 09:58:34] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2022-05-19 09:58:34] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:58:34] [INFO ] Computed 182 place invariants in 57 ms
[2022-05-19 09:58:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:58:51] [INFO ] Implicit Places using invariants and state equation in 17182 ms returned []
Implicit Place search using SMT with State Equation took 18798 ms to find 0 implicit places.
[2022-05-19 09:58:51] [INFO ] Redundant transitions in 66 ms returned []
[2022-05-19 09:58:51] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:58:52] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-19 09:58:54] [INFO ] Dead Transitions using invariants and state equation in 2220 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1593/1604 places, 2764/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1604 places, 2764/2775 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s83 1), p0:(OR (GEQ s1541 1) (GEQ s1539 1) (GEQ s1537 1) (GEQ s1535 1) (GEQ s1549 1) (GEQ s1547 1) (GEQ s1545 1) (GEQ s1543 1) (GEQ s1525 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7301 reset in 1192 ms.
Product exploration explored 100000 steps with 7386 reset in 1190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 136 steps, including 11 resets, run visited all 2 properties in 6 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 82 out of 1593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1593/1593 places, 2764/2764 transitions.
Applied a total of 0 rules in 78 ms. Remains 1593 /1593 variables (removed 0) and now considering 2764/2764 (removed 0) transitions.
[2022-05-19 09:58:57] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:58:57] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 09:58:59] [INFO ] Dead Transitions using invariants and state equation in 2308 ms found 0 transitions.
[2022-05-19 09:58:59] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:59:00] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 09:59:01] [INFO ] Implicit Places using invariants in 1549 ms returned []
[2022-05-19 09:59:01] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:59:01] [INFO ] Computed 182 place invariants in 63 ms
[2022-05-19 09:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:59:19] [INFO ] Implicit Places using invariants and state equation in 17696 ms returned []
Implicit Place search using SMT with State Equation took 19246 ms to find 0 implicit places.
[2022-05-19 09:59:19] [INFO ] Redundant transitions in 63 ms returned []
[2022-05-19 09:59:19] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:59:19] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 09:59:21] [INFO ] Dead Transitions using invariants and state equation in 2301 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1593 places, 2764/2764 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 24 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7360 reset in 1372 ms.
Product exploration explored 100000 steps with 7365 reset in 1456 ms.
Built C files in :
/tmp/ltsmin8745555960825263138
[2022-05-19 09:59:25] [INFO ] Too many transitions (2764) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:59:25] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8745555960825263138
Running compilation step : cd /tmp/ltsmin8745555960825263138;'/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/ltsmin8745555960825263138;'/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/ltsmin8745555960825263138;'/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 82 out of 1593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1593/1593 places, 2764/2764 transitions.
Applied a total of 0 rules in 77 ms. Remains 1593 /1593 variables (removed 0) and now considering 2764/2764 (removed 0) transitions.
[2022-05-19 09:59:28] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:59:28] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 09:59:30] [INFO ] Dead Transitions using invariants and state equation in 2225 ms found 0 transitions.
[2022-05-19 09:59:30] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:59:30] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 09:59:32] [INFO ] Implicit Places using invariants in 1561 ms returned []
[2022-05-19 09:59:32] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:59:32] [INFO ] Computed 182 place invariants in 55 ms
[2022-05-19 09:59:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:59:42] [INFO ] Implicit Places using invariants and state equation in 10261 ms returned []
Implicit Place search using SMT with State Equation took 11824 ms to find 0 implicit places.
[2022-05-19 09:59:42] [INFO ] Redundant transitions in 64 ms returned []
[2022-05-19 09:59:42] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2022-05-19 09:59:42] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-19 09:59:44] [INFO ] Dead Transitions using invariants and state equation in 2238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1593 places, 2764/2764 transitions.
Built C files in :
/tmp/ltsmin5003970275848407840
[2022-05-19 09:59:44] [INFO ] Too many transitions (2764) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:59:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5003970275848407840
Running compilation step : cd /tmp/ltsmin5003970275848407840;'/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/ltsmin5003970275848407840;'/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/ltsmin5003970275848407840;'/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 09:59:48] [INFO ] Flatten gal took : 117 ms
[2022-05-19 09:59:48] [INFO ] Flatten gal took : 120 ms
[2022-05-19 09:59:48] [INFO ] Time to serialize gal into /tmp/LTL3332196103028379490.gal : 14 ms
[2022-05-19 09:59:49] [INFO ] Time to serialize properties into /tmp/LTL15496164185727150178.ltl : 1531 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/LTL3332196103028379490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15496164185727150178.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/LTL3332196...267
Read 1 LTL properties
Checking formula 0 : !((F((G(((F("((((((((Schedule_Task_E_32>=1)||(Schedule_Task_E_30>=1))||((Schedule_Task_E_28>=1)||(Schedule_Task_E_26>=1)))||(((Schedul...4436
Formula 0 simplified : !F("(QueueJobE_0<1)" & G("(QueueJobE_0<1)" | (F"((((((((Schedule_Task_E_32>=1)||(Schedule_Task_E_30>=1))||((Schedule_Task_E_28>=1)||...4426
Detected timeout of ITS tools.
[2022-05-19 10:00:05] [INFO ] Flatten gal took : 113 ms
[2022-05-19 10:00:05] [INFO ] Applying decomposition
[2022-05-19 10:00:05] [INFO ] Flatten gal took : 115 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/graph9021624097309674912.txt' '-o' '/tmp/graph9021624097309674912.bin' '-w' '/tmp/graph9021624097309674912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9021624097309674912.bin' '-l' '-1' '-v' '-w' '/tmp/graph9021624097309674912.weights' '-q' '0' '-e' '0.001'
[2022-05-19 10:00:05] [INFO ] Decomposing Gal with order
[2022-05-19 10:00:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:00:05] [INFO ] Removed a total of 4961 redundant transitions.
[2022-05-19 10:00:05] [INFO ] Flatten gal took : 294 ms
[2022-05-19 10:00:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 63 ms.
[2022-05-19 10:00:06] [INFO ] Time to serialize gal into /tmp/LTL17205806504631781055.gal : 20 ms
[2022-05-19 10:00:06] [INFO ] Time to serialize properties into /tmp/LTL8665362896607816102.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/LTL17205806504631781055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8665362896607816102.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/LTL1720580...246
Read 1 LTL properties
Checking formula 0 : !((F((G(((F("((((((((i39.i3.u153.Schedule_Task_E_32>=1)||(i7.u12.Schedule_Task_E_30>=1))||((i21.u151.Schedule_Task_E_28>=1)||(i63.u149...5846
Formula 0 simplified : !F("(i20.u39.QueueJobE_0<1)" & G("(i20.u39.QueueJobE_0<1)" | (F"((((((((i39.i3.u153.Schedule_Task_E_32>=1)||(i7.u12.Schedule_Task_E_...5836
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13152074002757239896
[2022-05-19 10:00:21] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13152074002757239896
Running compilation step : cd /tmp/ltsmin13152074002757239896;'/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/ltsmin13152074002757239896;'/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/ltsmin13152074002757239896;'/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-COL-S10J80-LTLFireability-06 finished in 113570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&p1) U (!F(p2)||p2)))'
Support contains 94 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 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 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 171 place count 1519 transition count 2689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 172 place count 1518 transition count 2605
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 340 place count 1434 transition count 2605
Applied a total of 340 rules in 127 ms. Remains 1434 /1604 variables (removed 170) and now considering 2605/2775 (removed 170) transitions.
[2022-05-19 10:00:24] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2022-05-19 10:00:24] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:00:25] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
[2022-05-19 10:00:25] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2022-05-19 10:00:25] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 10:00:26] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2022-05-19 10:00:26] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2022-05-19 10:00:26] [INFO ] Computed 182 place invariants in 53 ms
[2022-05-19 10:00:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:00:34] [INFO ] Implicit Places using invariants and state equation in 8051 ms returned []
Implicit Place search using SMT with State Equation took 9163 ms to find 0 implicit places.
[2022-05-19 10:00:35] [INFO ] Redundant transitions in 63 ms returned []
[2022-05-19 10:00:35] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2022-05-19 10:00:35] [INFO ] Computed 182 place invariants in 62 ms
[2022-05-19 10:00:36] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1434/1604 places, 2605/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1434/1604 places, 2605/2775 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), false, (AND (NOT p0) p2), p2]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s495 1), p2:(GEQ s1430 1), p1:(OR (GEQ s1427 1) (AND (GEQ s1326 1) (GEQ s1373 1)) (AND (GEQ s1328 1) (GEQ s1401 1)) (AND (GEQ s1323 1) (GEQ s1396 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 191 steps with 12 reset in 5 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-07 finished in 12584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 81 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 87 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2022-05-19 10:00:36] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:00:36] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:00:39] [INFO ] Dead Transitions using invariants and state equation in 2423 ms found 0 transitions.
[2022-05-19 10:00:39] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:00:39] [INFO ] Computed 182 place invariants in 89 ms
[2022-05-19 10:00:40] [INFO ] Implicit Places using invariants in 1606 ms returned []
[2022-05-19 10:00:40] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:00:40] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:00:48] [INFO ] Implicit Places using invariants and state equation in 7721 ms returned []
Implicit Place search using SMT with State Equation took 9329 ms to find 0 implicit places.
[2022-05-19 10:00:48] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:00:48] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:00:50] [INFO ] Dead Transitions using invariants and state equation in 2363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s1549 1) (LT s1547 1) (LT s1545 1) (LT s1543 1) (LT s1557 1) (LT s1555 1) (LT s1553 1) (LT s1551 1) (LT s1533 1) (LT s1531 1) (LT s1594 1) (LT...], 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]]
Product exploration explored 100000 steps with 5603 reset in 1187 ms.
Entered a terminal (fully accepting) state of product in 82985 steps with 4643 reset in 1019 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-09 finished in 16522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(p0)))))'
Support contains 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 92 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2022-05-19 10:00:53] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:00:53] [INFO ] Computed 182 place invariants in 62 ms
[2022-05-19 10:00:55] [INFO ] Dead Transitions using invariants and state equation in 2404 ms found 0 transitions.
[2022-05-19 10:00:55] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:00:55] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:00:57] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2022-05-19 10:00:57] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:00:57] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-19 10:00:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:01:05] [INFO ] Implicit Places using invariants and state equation in 8476 ms returned []
Implicit Place search using SMT with State Equation took 10027 ms to find 0 implicit places.
[2022-05-19 10:01:05] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:05] [INFO ] Computed 182 place invariants in 62 ms
[2022-05-19 10:01:08] [INFO ] Dead Transitions using invariants and state equation in 2340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s500 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-10 finished in 15069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 94 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2022-05-19 10:01:08] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:08] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:01:10] [INFO ] Dead Transitions using invariants and state equation in 2245 ms found 0 transitions.
[2022-05-19 10:01:10] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:10] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:01:12] [INFO ] Implicit Places using invariants in 1550 ms returned []
[2022-05-19 10:01:12] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:12] [INFO ] Computed 182 place invariants in 57 ms
[2022-05-19 10:01:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:01:18] [INFO ] Implicit Places using invariants and state equation in 5895 ms returned []
Implicit Place search using SMT with State Equation took 7447 ms to find 0 implicit places.
[2022-05-19 10:01:18] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:18] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-19 10:01:20] [INFO ] Dead Transitions using invariants and state equation in 2392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s499 3)], 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-11 finished in 12285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 13 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 132 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2022-05-19 10:01:20] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:20] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-19 10:01:23] [INFO ] Dead Transitions using invariants and state equation in 2401 ms found 0 transitions.
[2022-05-19 10:01:23] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:23] [INFO ] Computed 182 place invariants in 55 ms
[2022-05-19 10:01:24] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2022-05-19 10:01:24] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:24] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 10:01:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:01:35] [INFO ] Implicit Places using invariants and state equation in 11089 ms returned []
Implicit Place search using SMT with State Equation took 12497 ms to find 0 implicit places.
[2022-05-19 10:01:35] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2022-05-19 10:01:35] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:01:38] [INFO ] Dead Transitions using invariants and state equation in 2406 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s503 1) (LT s504 1) (LT s509 1) (LT s514 8)) (OR (LT s503 1) (LT s506 1) (LT s513 1) (LT s514 8)) (OR (LT s503 1) (LT s510 1) (LT s512 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-12 finished in 17542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 892 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1604 transition count 2771
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1600 transition count 2770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1599 transition count 2770
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 10 place count 1599 transition count 2685
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 180 place count 1514 transition count 2685
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 1513 transition count 2684
Applied a total of 182 rules in 117 ms. Remains 1513 /1604 variables (removed 91) and now considering 2684/2775 (removed 91) transitions.
[2022-05-19 10:01:38] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:01:38] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 10:01:40] [INFO ] Dead Transitions using invariants and state equation in 2044 ms found 0 transitions.
[2022-05-19 10:01:40] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:01:40] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:01:41] [INFO ] Implicit Places using invariants in 868 ms returned []
[2022-05-19 10:01:41] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:01:41] [INFO ] Computed 182 place invariants in 53 ms
[2022-05-19 10:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:01:46] [INFO ] Implicit Places using invariants and state equation in 5054 ms returned []
Implicit Place search using SMT with State Equation took 5924 ms to find 0 implicit places.
[2022-05-19 10:01:46] [INFO ] Redundant transitions in 62 ms returned []
[2022-05-19 10:01:46] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:01:46] [INFO ] Computed 182 place invariants in 57 ms
[2022-05-19 10:01:48] [INFO ] Dead Transitions using invariants and state equation in 1984 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1513/1604 places, 2684/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1513/1604 places, 2684/2775 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s495 1), p0:(OR (AND (GEQ s642 1) (GEQ s1442 1)) (AND (GEQ s913 1) (GEQ s1469 1)) (AND (GEQ s538 1) (GEQ s1431 1)) (AND (GEQ s1316 1) (GEQ s1509 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7471 reset in 1361 ms.
Product exploration explored 100000 steps with 7502 reset in 1384 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 53 steps, including 3 resets, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 892 out of 1513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1513/1513 places, 2684/2684 transitions.
Applied a total of 0 rules in 44 ms. Remains 1513 /1513 variables (removed 0) and now considering 2684/2684 (removed 0) transitions.
[2022-05-19 10:01:51] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:01:51] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-19 10:01:53] [INFO ] Dead Transitions using invariants and state equation in 2079 ms found 0 transitions.
[2022-05-19 10:01:53] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:01:53] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 10:01:54] [INFO ] Implicit Places using invariants in 860 ms returned []
[2022-05-19 10:01:54] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:01:54] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 10:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:02:01] [INFO ] Implicit Places using invariants and state equation in 6462 ms returned []
Implicit Place search using SMT with State Equation took 7325 ms to find 0 implicit places.
[2022-05-19 10:02:01] [INFO ] Redundant transitions in 63 ms returned []
[2022-05-19 10:02:01] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:02:01] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:02:03] [INFO ] Dead Transitions using invariants and state equation in 2010 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1513/1513 places, 2684/2684 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 191 steps, including 14 resets, run visited all 2 properties in 11 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7433 reset in 4280 ms.
Product exploration explored 100000 steps with 7450 reset in 4349 ms.
Built C files in :
/tmp/ltsmin18078681304713845517
[2022-05-19 10:02:12] [INFO ] Too many transitions (2684) to apply POR reductions. Disabling POR matrices.
[2022-05-19 10:02:12] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18078681304713845517
Running compilation step : cd /tmp/ltsmin18078681304713845517;'/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/ltsmin18078681304713845517;'/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/ltsmin18078681304713845517;'/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 892 out of 1513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1513/1513 places, 2684/2684 transitions.
Applied a total of 0 rules in 44 ms. Remains 1513 /1513 variables (removed 0) and now considering 2684/2684 (removed 0) transitions.
[2022-05-19 10:02:15] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:02:15] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-19 10:02:17] [INFO ] Dead Transitions using invariants and state equation in 2036 ms found 0 transitions.
[2022-05-19 10:02:17] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:02:17] [INFO ] Computed 182 place invariants in 51 ms
[2022-05-19 10:02:18] [INFO ] Implicit Places using invariants in 831 ms returned []
[2022-05-19 10:02:18] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:02:18] [INFO ] Computed 182 place invariants in 56 ms
[2022-05-19 10:02:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:02:23] [INFO ] Implicit Places using invariants and state equation in 4557 ms returned []
Implicit Place search using SMT with State Equation took 5390 ms to find 0 implicit places.
[2022-05-19 10:02:23] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-19 10:02:23] [INFO ] Flow matrix only has 2675 transitions (discarded 9 similar events)
// Phase 1: matrix 2675 rows 1513 cols
[2022-05-19 10:02:23] [INFO ] Computed 182 place invariants in 57 ms
[2022-05-19 10:02:25] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1513/1513 places, 2684/2684 transitions.
Built C files in :
/tmp/ltsmin12526269041140256419
[2022-05-19 10:02:25] [INFO ] Too many transitions (2684) to apply POR reductions. Disabling POR matrices.
[2022-05-19 10:02:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12526269041140256419
Running compilation step : cd /tmp/ltsmin12526269041140256419;'/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/ltsmin12526269041140256419;'/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/ltsmin12526269041140256419;'/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 10:02:28] [INFO ] Flatten gal took : 117 ms
[2022-05-19 10:02:28] [INFO ] Flatten gal took : 118 ms
[2022-05-19 10:02:28] [INFO ] Time to serialize gal into /tmp/LTL13883968373646226720.gal : 11 ms
[2022-05-19 10:02:28] [INFO ] Time to serialize properties into /tmp/LTL2346811170226294734.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/LTL13883968373646226720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2346811170226294734.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/LTL1388396...267
Read 1 LTL properties
Checking formula 0 : !((G(F(((((((((((G("(NotifyEventEndOfCheckSourcesB_0<1)"))||("((CreatedJobs_131>=1)&&(Perform_Work_B_13>=1))"))||("(((CreatedJobs_402>...40402
Formula 0 simplified : !GF("(((((((((((CreatedJobs_192>=1)&&(Perform_Work_B_19>=1))||((CreatedJobs_449>=1)&&(Perform_Work_B_44>=1)))||(((CreatedJobs_769>=1...40366
Detected timeout of ITS tools.
[2022-05-19 10:02:43] [INFO ] Flatten gal took : 113 ms
[2022-05-19 10:02:43] [INFO ] Applying decomposition
[2022-05-19 10:02:43] [INFO ] Flatten gal took : 115 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/graph14002111209240057946.txt' '-o' '/tmp/graph14002111209240057946.bin' '-w' '/tmp/graph14002111209240057946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14002111209240057946.bin' '-l' '-1' '-v' '-w' '/tmp/graph14002111209240057946.weights' '-q' '0' '-e' '0.001'
[2022-05-19 10:02:44] [INFO ] Decomposing Gal with order
[2022-05-19 10:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:02:44] [INFO ] Removed a total of 2635 redundant transitions.
[2022-05-19 10:02:44] [INFO ] Flatten gal took : 274 ms
[2022-05-19 10:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 680 labels/synchronizations in 33 ms.
[2022-05-19 10:02:44] [INFO ] Time to serialize gal into /tmp/LTL8534754673762647958.gal : 13 ms
[2022-05-19 10:02:44] [INFO ] Time to serialize properties into /tmp/LTL18191409645141933971.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/LTL8534754673762647958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18191409645141933971.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/LTL8534754...246
Read 1 LTL properties
Checking formula 0 : !((G(F(((((((((((G("(i62.u81.NotifyEventEndOfCheckSourcesB_0<1)"))||("((u41.CreatedJobs_131>=1)&&(u41.Perform_Work_B_13>=1))"))||("(((...48230
Formula 0 simplified : !GF("(((((((((((i62.u45.CreatedJobs_192>=1)&&(i62.u45.Perform_Work_B_19>=1))||((i62.u59.CreatedJobs_449>=1)&&(i62.u59.Perform_Work_B...48194
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4951209780687070073
[2022-05-19 10:02:59] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4951209780687070073
Running compilation step : cd /tmp/ltsmin4951209780687070073;'/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/ltsmin4951209780687070073;'/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/ltsmin4951209780687070073;'/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-COL-S10J80-LTLFireability-13 finished in 84619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1)&&p2))))'
Support contains 3 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Applied a total of 0 rules in 44 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2022-05-19 10:03:02] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:02] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:03:05] [INFO ] Dead Transitions using invariants and state equation in 2513 ms found 0 transitions.
[2022-05-19 10:03:05] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:05] [INFO ] Computed 182 place invariants in 52 ms
[2022-05-19 10:03:06] [INFO ] Implicit Places using invariants in 1512 ms returned []
[2022-05-19 10:03:06] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:06] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:03:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:03:18] [INFO ] Implicit Places using invariants and state equation in 11694 ms returned []
Implicit Place search using SMT with State Equation took 13209 ms to find 0 implicit places.
[2022-05-19 10:03:18] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:18] [INFO ] Computed 182 place invariants in 63 ms
[2022-05-19 10:03:20] [INFO ] Dead Transitions using invariants and state equation in 2475 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1604/1604 places, 2775/2775 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s1434 1), p0:(LT s1602 1), p2:(LT s1598 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9529 reset in 743 ms.
Product exploration explored 100000 steps with 9511 reset in 783 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 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 402 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 10:03:23] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:23] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:03:23] [INFO ] [Real]Absence check using 176 positive place invariants in 53 ms returned sat
[2022-05-19 10:03:23] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 34 ms returned sat
[2022-05-19 10:03:23] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 10:03:24] [INFO ] [Nat]Absence check using 176 positive place invariants in 53 ms returned sat
[2022-05-19 10:03:24] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 42 ms returned sat
[2022-05-19 10:03:26] [INFO ] After 2394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 10:03:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:03:26] [INFO ] After 343ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 10:03:26] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 10:03:27] [INFO ] After 3299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1604 transition count 2692
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 1521 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 1520 transition count 2691
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 168 place count 1520 transition count 2606
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 338 place count 1435 transition count 2606
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 3 with 4 rules applied. Total rules applied 342 place count 1433 transition count 2604
Applied a total of 342 rules in 287 ms. Remains 1433 /1604 variables (removed 171) and now considering 2604/2775 (removed 171) transitions.
[2022-05-19 10:03:27] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2022-05-19 10:03:27] [INFO ] Computed 182 place invariants in 51 ms
[2022-05-19 10:03:28] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1433/1604 places, 2604/2775 transitions.
Finished random walk after 463 steps, including 34 resets, run visited all 1 properties in 7 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 406 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 98 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 2 out of 1604 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Applied a total of 0 rules in 52 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2022-05-19 10:03:29] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:29] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:03:31] [INFO ] Dead Transitions using invariants and state equation in 2503 ms found 0 transitions.
[2022-05-19 10:03:32] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:32] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 10:03:33] [INFO ] Implicit Places using invariants in 1524 ms returned []
[2022-05-19 10:03:33] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:33] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 10:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:03:46] [INFO ] Implicit Places using invariants and state equation in 12547 ms returned []
Implicit Place search using SMT with State Equation took 14077 ms to find 0 implicit places.
[2022-05-19 10:03:46] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:46] [INFO ] Computed 182 place invariants in 62 ms
[2022-05-19 10:03:48] [INFO ] Dead Transitions using invariants and state equation in 2511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1604/1604 places, 2775/2775 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 (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 238 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 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 10:03:49] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:03:49] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:03:49] [INFO ] [Real]Absence check using 176 positive place invariants in 54 ms returned sat
[2022-05-19 10:03:49] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 34 ms returned sat
[2022-05-19 10:03:49] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 10:03:49] [INFO ] [Nat]Absence check using 176 positive place invariants in 59 ms returned sat
[2022-05-19 10:03:49] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 39 ms returned sat
[2022-05-19 10:03:52] [INFO ] After 2358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 10:03:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:03:52] [INFO ] After 340ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 10:03:52] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-19 10:03:52] [INFO ] After 3244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1604 transition count 2692
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 1521 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 1520 transition count 2691
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 168 place count 1520 transition count 2606
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 338 place count 1435 transition count 2606
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 3 with 4 rules applied. Total rules applied 342 place count 1433 transition count 2604
Applied a total of 342 rules in 171 ms. Remains 1433 /1604 variables (removed 171) and now considering 2604/2775 (removed 171) transitions.
[2022-05-19 10:03:52] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2022-05-19 10:03:52] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-19 10:03:54] [INFO ] Dead Transitions using invariants and state equation in 1455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1433/1604 places, 2604/2775 transitions.
Finished random walk after 210 steps, including 14 resets, run visited all 1 properties in 4 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 266 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 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9463 reset in 744 ms.
Product exploration explored 100000 steps with 9555 reset in 785 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1604 transition count 2775
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 83 place count 1604 transition count 2776
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1604 transition count 2776
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 171 places in 1 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 171 place count 1604 transition count 2776
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 253 place count 1522 transition count 2694
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 335 place count 1522 transition count 2694
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 335 rules in 486 ms. Remains 1522 /1604 variables (removed 82) and now considering 2694/2775 (removed 81) transitions.
[2022-05-19 10:03:57] [INFO ] Flow matrix only has 2685 transitions (discarded 9 similar events)
// Phase 1: matrix 2685 rows 1522 cols
[2022-05-19 10:03:57] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-19 10:04:00] [INFO ] Dead Transitions using invariants and state equation in 3710 ms found 0 transitions.
[2022-05-19 10:04:00] [INFO ] Redundant transitions in 63 ms returned []
[2022-05-19 10:04:00] [INFO ] Flow matrix only has 2685 transitions (discarded 9 similar events)
// Phase 1: matrix 2685 rows 1522 cols
[2022-05-19 10:04:01] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-19 10:04:04] [INFO ] Dead Transitions using invariants and state equation in 3937 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1522/1604 places, 2694/2775 transitions.
Finished structural reductions, in 1 iterations. Remains : 1522/1604 places, 2694/2775 transitions.
Product exploration explored 100000 steps with 13296 reset in 2627 ms.
Product exploration explored 100000 steps with 13190 reset in 2573 ms.
Built C files in :
/tmp/ltsmin7050204566168779040
[2022-05-19 10:04:10] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7050204566168779040
Running compilation step : cd /tmp/ltsmin7050204566168779040;'/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/ltsmin7050204566168779040;'/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/ltsmin7050204566168779040;'/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 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Applied a total of 0 rules in 64 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2022-05-19 10:04:13] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:04:13] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-19 10:04:15] [INFO ] Dead Transitions using invariants and state equation in 2415 ms found 0 transitions.
[2022-05-19 10:04:15] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:04:15] [INFO ] Computed 182 place invariants in 57 ms
[2022-05-19 10:04:17] [INFO ] Implicit Places using invariants in 1442 ms returned []
[2022-05-19 10:04:17] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:04:17] [INFO ] Computed 182 place invariants in 53 ms
[2022-05-19 10:04:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:04:29] [INFO ] Implicit Places using invariants and state equation in 12717 ms returned []
Implicit Place search using SMT with State Equation took 14161 ms to find 0 implicit places.
[2022-05-19 10:04:29] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2022-05-19 10:04:29] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-19 10:04:32] [INFO ] Dead Transitions using invariants and state equation in 2512 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1604/1604 places, 2775/2775 transitions.
Built C files in :
/tmp/ltsmin15923638381139562726
[2022-05-19 10:04:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15923638381139562726
Running compilation step : cd /tmp/ltsmin15923638381139562726;'/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/ltsmin15923638381139562726;'/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/ltsmin15923638381139562726;'/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 10:04:35] [INFO ] Flatten gal took : 125 ms
[2022-05-19 10:04:35] [INFO ] Flatten gal took : 114 ms
[2022-05-19 10:04:35] [INFO ] Time to serialize gal into /tmp/LTL6132544013406966199.gal : 11 ms
[2022-05-19 10:04:35] [INFO ] Time to serialize properties into /tmp/LTL16457208844753602368.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/LTL6132544013406966199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16457208844753602368.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/LTL6132544...267
Read 1 LTL properties
Checking formula 0 : !((X((G("(Try_Check_Sources_E_0<1)"))||((F("(place_787_0>=1)"))&&("(Schedule_Task_E_81<1)")))))
Formula 0 simplified : !X(G"(Try_Check_Sources_E_0<1)" | ("(Schedule_Task_E_81<1)" & F"(place_787_0>=1)"))
Detected timeout of ITS tools.
[2022-05-19 10:04:50] [INFO ] Flatten gal took : 108 ms
[2022-05-19 10:04:50] [INFO ] Applying decomposition
[2022-05-19 10:04:51] [INFO ] Flatten gal took : 110 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/graph15620718053959189053.txt' '-o' '/tmp/graph15620718053959189053.bin' '-w' '/tmp/graph15620718053959189053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15620718053959189053.bin' '-l' '-1' '-v' '-w' '/tmp/graph15620718053959189053.weights' '-q' '0' '-e' '0.001'
[2022-05-19 10:04:51] [INFO ] Decomposing Gal with order
[2022-05-19 10:04:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:04:51] [INFO ] Removed a total of 2651 redundant transitions.
[2022-05-19 10:04:51] [INFO ] Flatten gal took : 315 ms
[2022-05-19 10:04:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 771 labels/synchronizations in 46 ms.
[2022-05-19 10:04:51] [INFO ] Time to serialize gal into /tmp/LTL9459328450241979321.gal : 20 ms
[2022-05-19 10:04:51] [INFO ] Time to serialize properties into /tmp/LTL8343779839882454629.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/LTL9459328450241979321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8343779839882454629.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/LTL9459328...245
Read 1 LTL properties
Checking formula 0 : !((X((G("(i28.u65.Try_Check_Sources_E_0<1)"))||((F("(i28.u167.place_787_0>=1)"))&&("(i28.u167.Schedule_Task_E_81<1)")))))
Formula 0 simplified : !X(G"(i28.u65.Try_Check_Sources_E_0<1)" | ("(i28.u167.Schedule_Task_E_81<1)" & F"(i28.u167.place_787_0>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2996230123593001128
[2022-05-19 10:05:06] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2996230123593001128
Running compilation step : cd /tmp/ltsmin2996230123593001128;'/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/ltsmin2996230123593001128;'/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/ltsmin2996230123593001128;'/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-COL-S10J80-LTLFireability-14 finished in 127085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(X(G(p0)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((F(p0) U p0)||p1))&&p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1)&&p2))))'
[2022-05-19 10:05:10] [INFO ] Flatten gal took : 118 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6533630568050054898
[2022-05-19 10:05:10] [INFO ] Too many transitions (2775) to apply POR reductions. Disabling POR matrices.
[2022-05-19 10:05:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6533630568050054898
Running compilation step : cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 10:05:10] [INFO ] Applying decomposition
[2022-05-19 10:05:10] [INFO ] Flatten gal took : 120 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/graph5968061857508717890.txt' '-o' '/tmp/graph5968061857508717890.bin' '-w' '/tmp/graph5968061857508717890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5968061857508717890.bin' '-l' '-1' '-v' '-w' '/tmp/graph5968061857508717890.weights' '-q' '0' '-e' '0.001'
[2022-05-19 10:05:10] [INFO ] Decomposing Gal with order
[2022-05-19 10:05:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:05:11] [INFO ] Removed a total of 2651 redundant transitions.
[2022-05-19 10:05:11] [INFO ] Flatten gal took : 400 ms
[2022-05-19 10:05:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 791 labels/synchronizations in 58 ms.
[2022-05-19 10:05:11] [INFO ] Time to serialize gal into /tmp/LTLFireability15991227279650682291.gal : 21 ms
[2022-05-19 10:05:11] [INFO ] Time to serialize properties into /tmp/LTLFireability7832708380975785074.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/LTLFireability15991227279650682291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7832708380975785074.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((F(X(X(F(X(G("((i55.u129.Schedule_Task_B_0>=1)||((((((((i55.u129.Schedule_Task_B_0<1)&&(((i13.u0.block_0<1)||(i13.u44.QueueJobB_43<1...5852
Formula 0 simplified : !FXXFXG"((i55.u129.Schedule_Task_B_0>=1)||((((((((i55.u129.Schedule_Task_B_0<1)&&(((i13.u0.block_0<1)||(i13.u44.QueueJobB_43<1))||(i...5838
Compilation finished in 6882 ms.
Running link step : cd /tmp/ltsmin6533630568050054898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(<>(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(<>(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](((<>((LTLAPp1==true)) U (LTLAPp1==true))||(LTLAPp2==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 10:28:23] [INFO ] Applying decomposition
[2022-05-19 10:28:23] [INFO ] Flatten gal took : 265 ms
[2022-05-19 10:28:23] [INFO ] Decomposing Gal with order
[2022-05-19 10:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:28:24] [INFO ] Removed a total of 11516 redundant transitions.
[2022-05-19 10:28:24] [INFO ] Flatten gal took : 606 ms
[2022-05-19 10:28:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 72 ms.
[2022-05-19 10:28:25] [INFO ] Time to serialize gal into /tmp/LTLFireability12736646404864896525.gal : 51 ms
[2022-05-19 10:28:25] [INFO ] Time to serialize properties into /tmp/LTLFireability14908952347459777087.ltl : 14 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/LTLFireability12736646404864896525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14908952347459777087.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...269
Read 4 LTL properties
Checking formula 0 : !((F(X(X(F(X(G("((Schedule_Task_B.Schedule_Task_B_0>=1)||((((((((Schedule_Task_B.Schedule_Task_B_0<1)&&(((block.block_0<1)||(ThreadsJo...5937
Formula 0 simplified : !FXXFXG"((Schedule_Task_B.Schedule_Task_B_0>=1)||((((((((Schedule_Task_B.Schedule_Task_B_0<1)&&(((block.block_0<1)||(ThreadsJobs43.Q...5923
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](((<>((LTLAPp1==true)) U (LTLAPp1==true))||(LTLAPp2==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2022-05-19 10:41:30] [INFO ] Flatten gal took : 168 ms
[2022-05-19 10:41:35] [INFO ] Input system was already deterministic with 2775 transitions.
[2022-05-19 10:41:36] [INFO ] Transformed 1604 places.
[2022-05-19 10:41:36] [INFO ] Transformed 2775 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 10:42:06] [INFO ] Time to serialize gal into /tmp/LTLFireability4495845633305868776.gal : 65 ms
[2022-05-19 10:42:06] [INFO ] Time to serialize properties into /tmp/LTLFireability10949610038813582451.ltl : 27 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/LTLFireability4495845633305868776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10949610038813582451.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(X(F(X(G("((Schedule_Task_B_0>=1)||((((((((Schedule_Task_B_0<1)&&(((block_0<1)||(QueueJobB_43<1))||(mi3_0<1)))&&((((block_0<1)||...3971
Formula 0 simplified : !FXXFXG"((Schedule_Task_B_0>=1)||((((((((Schedule_Task_B_0<1)&&(((block_0<1)||(QueueJobB_43<1))||(mi3_0<1)))&&((((block_0<1)||(Queue...3957
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6533630568050054898;'/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(([]((LTLAPp5==true))||(<>((LTLAPp6==true))&&(LTLAPp7==true))))' '--buchi-type=spotba'
LTSmin run took 1162 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin6533630568050054898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(<>(X([]((LTLAPp0==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-COL-S10J80"
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-COL-S10J80, 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-165277017200804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;