About the Execution of 2023-gold for ResIsolation-PT-N08P2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15466.300 | 3557817.00 | 9350182.00 | 5889.30 | FFTFFFTFFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r649-smll-171774451500007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ResIsolation-PT-N08P2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451500007
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.5M
-rw-r--r-- 1 mcc users 5.6K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 9.2M Jun 7 06:26 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 ResIsolation-PT-N08P2-LTLCardinality-00
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-01
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-02
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-03
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-04
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-05
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-06
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-07
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-08
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-09
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-10
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-11
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-12
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-13
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-14
FORMULA_NAME ResIsolation-PT-N08P2-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717749126895
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N08P2
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-07 08:32:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 08:32:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:32:10] [INFO ] Load time of PNML (sax parser for PT used): 914 ms
[2024-06-07 08:32:10] [INFO ] Transformed 309 places.
[2024-06-07 08:32:10] [INFO ] Transformed 9493 transitions.
[2024-06-07 08:32:10] [INFO ] Found NUPN structural information;
[2024-06-07 08:32:10] [INFO ] Parsed PT model containing 309 places and 9493 transitions and 184883 arcs in 1117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 9493/9493 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 300 transition count 9493
Discarding 149 places :
Symmetric choice reduction at 1 with 149 rule applications. Total rules 158 place count 151 transition count 9344
Iterating global reduction 1 with 149 rules applied. Total rules applied 307 place count 151 transition count 9344
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 391 place count 151 transition count 9260
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 401 place count 141 transition count 9250
Iterating global reduction 2 with 10 rules applied. Total rules applied 411 place count 141 transition count 9250
Applied a total of 411 rules in 459 ms. Remains 141 /309 variables (removed 168) and now considering 9250/9493 (removed 243) transitions.
// Phase 1: matrix 9250 rows 141 cols
[2024-06-07 08:32:11] [INFO ] Computed 1 invariants in 255 ms
[2024-06-07 08:32:13] [INFO ] Implicit Places using invariants in 2087 ms returned []
[2024-06-07 08:32:13] [INFO ] Invariant cache hit.
[2024-06-07 08:32:15] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 3770 ms to find 0 implicit places.
[2024-06-07 08:32:15] [INFO ] Invariant cache hit.
[2024-06-07 08:32:21] [INFO ] Dead Transitions using invariants and state equation in 6287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/309 places, 9250/9493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10551 ms. Remains : 141/309 places, 9250/9493 transitions.
Support contains 33 out of 141 places after structural reductions.
[2024-06-07 08:32:24] [INFO ] Flatten gal took : 2182 ms
[2024-06-07 08:32:25] [INFO ] Flatten gal took : 1701 ms
[2024-06-07 08:32:28] [INFO ] Input system was already deterministic with 9250 transitions.
Support contains 30 out of 141 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 17) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-07 08:32:31] [INFO ] Invariant cache hit.
[2024-06-07 08:32:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-07 08:32:32] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-07 08:32:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-07 08:32:39] [INFO ] After 6617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-07 08:32:44] [INFO ] Deduced a trap composed of 38 places in 4322 ms of which 3 ms to minimize.
[2024-06-07 08:32:48] [INFO ] Deduced a trap composed of 30 places in 3870 ms of which 5 ms to minimize.
[2024-06-07 08:32:52] [INFO ] Deduced a trap composed of 29 places in 3233 ms of which 2 ms to minimize.
[2024-06-07 08:32:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 12449 ms
[2024-06-07 08:33:00] [INFO ] Deduced a trap composed of 37 places in 5664 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 08:33:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 08:33:00] [INFO ] After 28655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 9 properties in 3066 ms.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Graph (trivial) has 106 edges and 141 vertex of which 24 / 141 are part of one of the 8 SCC in 7 ms
Free SCC test removed 16 places
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 1078 edges and 125 vertex of which 117 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.78 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 117 transition count 9179
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 72 place count 87 transition count 9179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 72 place count 87 transition count 9177
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 85 transition count 9177
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 88 place count 73 transition count 9165
Iterating global reduction 2 with 12 rules applied. Total rules applied 100 place count 73 transition count 9165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 73 transition count 9164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 101 place count 73 transition count 9163
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 72 transition count 9163
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 72 transition count 9162
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 140 place count 54 transition count 9144
Drop transitions removed 2 transitions
Ensure Unique test removed 558 transitions
Reduce isomorphic transitions removed 560 transitions.
Iterating post reduction 4 with 560 rules applied. Total rules applied 700 place count 54 transition count 8584
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 828 place count 54 transition count 8456
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 840 place count 54 transition count 8444
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1920 transitions
Reduce isomorphic transitions removed 1920 transitions.
Iterating post reduction 5 with 1932 rules applied. Total rules applied 2772 place count 42 transition count 6524
Drop transitions removed 384 transitions
Redundant transition composition rules discarded 384 transitions
Iterating global reduction 6 with 384 rules applied. Total rules applied 3156 place count 42 transition count 6140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3157 place count 41 transition count 6139
Applied a total of 3157 rules in 101466 ms. Remains 41 /141 variables (removed 100) and now considering 6139/9250 (removed 3111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101467 ms. Remains : 41/141 places, 6139/9250 transitions.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ResIsolation-PT-N08P2-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 51 stabilizing places and 60 stable transitions
Graph (complete) has 1121 edges and 141 vertex of which 133 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.241 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F(p1)&&G(p2))))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 9250
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 123 transition count 9233
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 123 transition count 9233
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Iterating post reduction 1 with 433 rules applied. Total rules applied 468 place count 123 transition count 8800
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 472 place count 119 transition count 8796
Iterating global reduction 2 with 4 rules applied. Total rules applied 476 place count 119 transition count 8796
Applied a total of 476 rules in 214 ms. Remains 119 /141 variables (removed 22) and now considering 8796/9250 (removed 454) transitions.
// Phase 1: matrix 8796 rows 119 cols
[2024-06-07 08:34:46] [INFO ] Computed 0 invariants in 158 ms
[2024-06-07 08:34:48] [INFO ] Implicit Places using invariants in 2113 ms returned []
[2024-06-07 08:34:48] [INFO ] Invariant cache hit.
[2024-06-07 08:34:49] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 3420 ms to find 0 implicit places.
[2024-06-07 08:34:49] [INFO ] Invariant cache hit.
[2024-06-07 08:34:56] [INFO ] Dead Transitions using invariants and state equation in 6685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/141 places, 8796/9250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10322 ms. Remains : 119/141 places, 8796/9250 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (EQ s59 0) (EQ s99 1)), p0:(AND (EQ s4 1) (OR (EQ s66 0) (EQ s53 1))), p1:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3290 ms.
Entered a terminal (fully accepting) state of product in 110 steps with 1 reset in 7 ms.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-00 finished in 14162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Graph (trivial) has 99 edges and 141 vertex of which 21 / 141 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1101 edges and 127 vertex of which 122 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.69 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 121 transition count 9211
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 101 transition count 9211
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 42 place count 101 transition count 9200
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 64 place count 90 transition count 9200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 84 transition count 9194
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 84 transition count 9194
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 2 with 65 rules applied. Total rules applied 141 place count 84 transition count 9129
Performed 15 Post agglomeration using F-continuation condition with reduction of 240 identical transitions.
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 171 place count 69 transition count 8874
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 3 with 128 rules applied. Total rules applied 299 place count 69 transition count 8746
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 305 place count 66 transition count 8754
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 66 transition count 8752
Applied a total of 307 rules in 57538 ms. Remains 66 /141 variables (removed 75) and now considering 8752/9250 (removed 498) transitions.
[2024-06-07 08:35:57] [INFO ] Flow matrix only has 8746 transitions (discarded 6 similar events)
// Phase 1: matrix 8746 rows 66 cols
[2024-06-07 08:35:57] [INFO ] Computed 0 invariants in 42 ms
[2024-06-07 08:35:59] [INFO ] Implicit Places using invariants in 1967 ms returned []
[2024-06-07 08:35:59] [INFO ] Flow matrix only has 8746 transitions (discarded 6 similar events)
[2024-06-07 08:35:59] [INFO ] Invariant cache hit.
[2024-06-07 08:36:00] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
[2024-06-07 08:36:27] [INFO ] Redundant transitions in 26623 ms returned []
[2024-06-07 08:36:27] [INFO ] Flow matrix only has 8746 transitions (discarded 6 similar events)
[2024-06-07 08:36:27] [INFO ] Invariant cache hit.
[2024-06-07 08:36:32] [INFO ] Dead Transitions using invariants and state equation in 4913 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/141 places, 8752/9250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92400 ms. Remains : 66/141 places, 8752/9250 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s26 0) (EQ s43 1)), p1:(AND (EQ s11 0) (EQ s59 1) (OR (EQ s37 0) (EQ s48 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-04 finished in 92579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Graph (trivial) has 105 edges and 141 vertex of which 24 / 141 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1098 edges and 125 vertex of which 117 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.43 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 116 transition count 9206
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 96 transition count 9206
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 42 place count 96 transition count 9195
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 64 place count 85 transition count 9195
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 78 transition count 9188
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 78 transition count 9188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 78 transition count 9187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 79 place count 78 transition count 9186
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 77 transition count 9186
Performed 13 Post agglomeration using F-continuation condition with reduction of 240 identical transitions.
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 107 place count 64 transition count 8933
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 3 with 192 rules applied. Total rules applied 299 place count 64 transition count 8741
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 305 place count 61 transition count 8749
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 306 place count 61 transition count 8748
Applied a total of 306 rules in 52467 ms. Remains 61 /141 variables (removed 80) and now considering 8748/9250 (removed 502) transitions.
[2024-06-07 08:37:25] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
// Phase 1: matrix 8741 rows 61 cols
[2024-06-07 08:37:25] [INFO ] Computed 0 invariants in 50 ms
[2024-06-07 08:37:26] [INFO ] Implicit Places using invariants in 1768 ms returned []
[2024-06-07 08:37:26] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:37:26] [INFO ] Invariant cache hit.
[2024-06-07 08:37:28] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 3073 ms to find 0 implicit places.
[2024-06-07 08:37:55] [INFO ] Redundant transitions in 27683 ms returned []
[2024-06-07 08:37:55] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:37:55] [INFO ] Invariant cache hit.
[2024-06-07 08:38:00] [INFO ] Dead Transitions using invariants and state equation in 4631 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/141 places, 8748/9250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87869 ms. Remains : 61/141 places, 8748/9250 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s58 0) (EQ s22 1)), p0:(OR (EQ s48 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 149 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1248 resets, run finished after 1109 ms. (steps per millisecond=9 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-07 08:38:02] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:38:02] [INFO ] Invariant cache hit.
[2024-06-07 08:38:02] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 08:38:05] [INFO ] After 2846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 08:38:21] [INFO ] State equation strengthened by 8690 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 08:38:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 08:38:27] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 8748/8748 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 61 transition count 8734
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 56 transition count 8729
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 1 with 256 rules applied. Total rules applied 280 place count 56 transition count 8473
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 292 place count 56 transition count 8461
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 1 with 1548 rules applied. Total rules applied 1840 place count 44 transition count 6925
Drop transitions removed 768 transitions
Redundant transition composition rules discarded 768 transitions
Iterating global reduction 2 with 768 rules applied. Total rules applied 2608 place count 44 transition count 6157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2609 place count 43 transition count 6156
Applied a total of 2609 rules in 90425 ms. Remains 43 /61 variables (removed 18) and now considering 6156/8748 (removed 2592) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90429 ms. Remains : 43/61 places, 6156/8748 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 248 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p1)]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 8748/8748 transitions.
Applied a total of 0 rules in 25579 ms. Remains 61 /61 variables (removed 0) and now considering 8748/8748 (removed 0) transitions.
[2024-06-07 08:40:24] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:40:24] [INFO ] Invariant cache hit.
[2024-06-07 08:40:25] [INFO ] Implicit Places using invariants in 1717 ms returned []
[2024-06-07 08:40:25] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:40:25] [INFO ] Invariant cache hit.
[2024-06-07 08:40:27] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
[2024-06-07 08:40:53] [INFO ] Redundant transitions in 26474 ms returned []
[2024-06-07 08:40:53] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:40:53] [INFO ] Invariant cache hit.
[2024-06-07 08:40:59] [INFO ] Dead Transitions using invariants and state equation in 5982 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60984 ms. Remains : 61/61 places, 8748/8748 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 129 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1250 resets, run finished after 1006 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 146 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 113650 steps, run timeout after 3004 ms. (steps per millisecond=37 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 113650 steps, saw 23596 distinct states, run finished after 3005 ms. (steps per millisecond=37 ) properties seen :4
Running SMT prover for 1 properties.
[2024-06-07 08:41:04] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:41:04] [INFO ] Invariant cache hit.
[2024-06-07 08:41:04] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 08:41:07] [INFO ] After 2737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 08:41:22] [INFO ] State equation strengthened by 8690 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 08:41:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 08:41:29] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 8748/8748 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 61 transition count 8734
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 56 transition count 8729
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 1 with 256 rules applied. Total rules applied 280 place count 56 transition count 8473
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 292 place count 56 transition count 8461
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 1 with 1548 rules applied. Total rules applied 1840 place count 44 transition count 6925
Drop transitions removed 768 transitions
Redundant transition composition rules discarded 768 transitions
Iterating global reduction 2 with 768 rules applied. Total rules applied 2608 place count 44 transition count 6157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2609 place count 43 transition count 6156
Applied a total of 2609 rules in 98646 ms. Remains 43 /61 variables (removed 18) and now considering 6156/8748 (removed 2592) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98647 ms. Remains : 43/61 places, 6156/8748 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 263 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 326 ms.
Built C files in :
/tmp/ltsmin10411562533336512120
[2024-06-07 08:43:09] [INFO ] Too many transitions (8748) to apply POR reductions. Disabling POR matrices.
[2024-06-07 08:43:09] [INFO ] Built C files in 276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10411562533336512120
Running compilation step : cd /tmp/ltsmin10411562533336512120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10411562533336512120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10411562533336512120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 8748/8748 transitions.
Applied a total of 0 rules in 26181 ms. Remains 61 /61 variables (removed 0) and now considering 8748/8748 (removed 0) transitions.
[2024-06-07 08:43:39] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:43:39] [INFO ] Invariant cache hit.
[2024-06-07 08:43:40] [INFO ] Implicit Places using invariants in 1756 ms returned []
[2024-06-07 08:43:40] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:43:40] [INFO ] Invariant cache hit.
[2024-06-07 08:43:42] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 3077 ms to find 0 implicit places.
[2024-06-07 08:44:09] [INFO ] Redundant transitions in 27667 ms returned []
[2024-06-07 08:44:09] [INFO ] Flow matrix only has 8741 transitions (discarded 7 similar events)
[2024-06-07 08:44:09] [INFO ] Invariant cache hit.
[2024-06-07 08:44:15] [INFO ] Dead Transitions using invariants and state equation in 5834 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62776 ms. Remains : 61/61 places, 8748/8748 transitions.
Built C files in :
/tmp/ltsmin1930982027094210398
[2024-06-07 08:44:15] [INFO ] Too many transitions (8748) to apply POR reductions. Disabling POR matrices.
[2024-06-07 08:44:15] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1930982027094210398
Running compilation step : cd /tmp/ltsmin1930982027094210398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1930982027094210398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1930982027094210398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 08:44:21] [INFO ] Flatten gal took : 1129 ms
[2024-06-07 08:44:22] [INFO ] Flatten gal took : 980 ms
[2024-06-07 08:44:22] [INFO ] Time to serialize gal into /tmp/LTL13717981038783603361.gal : 186 ms
[2024-06-07 08:44:22] [INFO ] Time to serialize properties into /tmp/LTL4053587237369741683.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13717981038783603361.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11829915429709659579.hoa' '-atoms' '/tmp/LTL4053587237369741683.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4053587237369741683.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11829915429709659579.hoa
Detected timeout of ITS tools.
[2024-06-07 08:44:39] [INFO ] Flatten gal took : 966 ms
[2024-06-07 08:44:40] [INFO ] Flatten gal took : 896 ms
[2024-06-07 08:44:40] [INFO ] Time to serialize gal into /tmp/LTL13351156630470493103.gal : 109 ms
[2024-06-07 08:44:40] [INFO ] Time to serialize properties into /tmp/LTL10742656911902827815.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13351156630470493103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10742656911902827815.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("((p242==0)||(p182==1))")U(G("((p295==0)||(p101==1))"))))
Formula 0 simplified : !"((p242==0)||(p182==1))" R F!"((p295==0)||(p101==1))"
Detected timeout of ITS tools.
[2024-06-07 08:44:56] [INFO ] Flatten gal took : 917 ms
[2024-06-07 08:44:56] [INFO ] Applying decomposition
[2024-06-07 08:44:57] [INFO ] Flatten gal took : 930 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13428624288589944123.txt' '-o' '/tmp/graph13428624288589944123.bin' '-w' '/tmp/graph13428624288589944123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13428624288589944123.bin' '-l' '-1' '-v' '-w' '/tmp/graph13428624288589944123.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:44:59] [INFO ] Decomposing Gal with order
[2024-06-07 08:44:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:45:02] [INFO ] Removed a total of 88992 redundant transitions.
[2024-06-07 08:45:02] [INFO ] Flatten gal took : 2124 ms
[2024-06-07 08:45:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 459 ms.
[2024-06-07 08:45:03] [INFO ] Time to serialize gal into /tmp/LTL10284934703785448880.gal : 106 ms
[2024-06-07 08:45:03] [INFO ] Time to serialize properties into /tmp/LTL17838272468912722249.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10284934703785448880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17838272468912722249.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((("((i5.u10.p242==0)||(i4.u7.p182==1))")U(G("((i5.u12.p295==0)||(u3.p101==1))"))))
Formula 0 simplified : !"((i5.u10.p242==0)||(i4.u7.p182==1))" R F!"((i5.u12.p295==0)||(u3.p101==1))"
Reverse transition relation is NOT exact ! Due to transitions t39, t63, t43_t45, t34_t36_t37_t38, t25_t28, t8_t11, t17_t19_t20_t23, t7_t16_t24_t33_t42_t48_...1566
Computing Next relation with stutter on 10 deadlock states
10 unique states visited
9 strongly connected components in search stack
12 transitions explored
10 items max in DFS search stack
459 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.25141,79556,1,0,31534,1860,81193,153044,413,6793,332365
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-05 finished in 519272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Graph (trivial) has 107 edges and 141 vertex of which 24 / 141 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1098 edges and 125 vertex of which 117 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.42 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 116 transition count 9206
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 96 transition count 9206
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 42 place count 96 transition count 9195
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 64 place count 85 transition count 9195
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 77 transition count 9187
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 77 transition count 9187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 77 transition count 9186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 77 transition count 9185
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 76 transition count 9185
Performed 14 Post agglomeration using F-continuation condition with reduction of 432 identical transitions.
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 111 place count 62 transition count 8739
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 367 place count 62 transition count 8483
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 373 place count 59 transition count 8491
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 374 place count 59 transition count 8490
Applied a total of 374 rules in 55371 ms. Remains 59 /141 variables (removed 82) and now considering 8490/9250 (removed 760) transitions.
[2024-06-07 08:46:07] [INFO ] Flow matrix only has 8483 transitions (discarded 7 similar events)
// Phase 1: matrix 8483 rows 59 cols
[2024-06-07 08:46:07] [INFO ] Computed 0 invariants in 47 ms
[2024-06-07 08:46:09] [INFO ] Implicit Places using invariants in 1756 ms returned []
[2024-06-07 08:46:09] [INFO ] Flow matrix only has 8483 transitions (discarded 7 similar events)
[2024-06-07 08:46:09] [INFO ] Invariant cache hit.
[2024-06-07 08:46:10] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 3012 ms to find 0 implicit places.
[2024-06-07 08:46:36] [INFO ] Redundant transitions in 26381 ms returned []
[2024-06-07 08:46:36] [INFO ] Flow matrix only has 8483 transitions (discarded 7 similar events)
[2024-06-07 08:46:36] [INFO ] Invariant cache hit.
[2024-06-07 08:46:42] [INFO ] Dead Transitions using invariants and state equation in 5487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/141 places, 8490/9250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90264 ms. Remains : 59/141 places, 8490/9250 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-07 finished in 90355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)||(p1&&F(p0)&&(p2 U p3))))))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 9250
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 123 transition count 9233
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 123 transition count 9233
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Iterating post reduction 1 with 433 rules applied. Total rules applied 468 place count 123 transition count 8800
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 472 place count 119 transition count 8796
Iterating global reduction 2 with 4 rules applied. Total rules applied 476 place count 119 transition count 8796
Applied a total of 476 rules in 206 ms. Remains 119 /141 variables (removed 22) and now considering 8796/9250 (removed 454) transitions.
// Phase 1: matrix 8796 rows 119 cols
[2024-06-07 08:46:42] [INFO ] Computed 0 invariants in 151 ms
[2024-06-07 08:46:44] [INFO ] Implicit Places using invariants in 1833 ms returned []
[2024-06-07 08:46:44] [INFO ] Invariant cache hit.
[2024-06-07 08:46:45] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
[2024-06-07 08:46:45] [INFO ] Invariant cache hit.
[2024-06-07 08:46:50] [INFO ] Dead Transitions using invariants and state equation in 4445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/141 places, 8796/9250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7779 ms. Remains : 119/141 places, 8796/9250 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(EQ s49 1), p0:(OR (EQ s107 0) (EQ s27 1)), p3:(EQ s94 1), p2:(OR (EQ s87 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2926 ms.
Product exploration explored 100000 steps with 0 reset in 2981 ms.
Computed a total of 40 stabilizing places and 50 stable transitions
Graph (complete) has 903 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.109 ms
Computed a total of 40 stabilizing places and 50 stable transitions
Detected a total of 40/119 stabilizing places and 50/8796 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) p2), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 826 ms. (steps per millisecond=12 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-07 08:46:58] [INFO ] Invariant cache hit.
[2024-06-07 08:46:58] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-07 08:47:03] [INFO ] After 4637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-07 08:47:06] [INFO ] After 7880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1462 ms.
[2024-06-07 08:47:08] [INFO ] After 9424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 8796/8796 transitions.
Graph (trivial) has 78 edges and 119 vertex of which 21 / 119 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 871 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 103 transition count 8744
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 52 place count 84 transition count 8742
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 82 transition count 8742
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 54 place count 82 transition count 8739
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 79 transition count 8739
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 94 place count 62 transition count 8722
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 3 with 256 rules applied. Total rules applied 350 place count 62 transition count 8466
Free-agglomeration rule applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 363 place count 62 transition count 8453
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 3 with 1549 rules applied. Total rules applied 1912 place count 49 transition count 6917
Drop transitions removed 769 transitions
Redundant transition composition rules discarded 769 transitions
Iterating global reduction 4 with 769 rules applied. Total rules applied 2681 place count 49 transition count 6148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2682 place count 48 transition count 6147
Applied a total of 2682 rules in 41274 ms. Remains 48 /119 variables (removed 71) and now considering 6147/8796 (removed 2649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41274 ms. Remains : 48/119 places, 6147/8796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6556 ms. (steps per millisecond=1 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6147 rows 48 cols
[2024-06-07 08:47:56] [INFO ] Computed 10 invariants in 28 ms
[2024-06-07 08:47:56] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 08:47:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-07 08:47:58] [INFO ] After 1965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 08:47:58] [INFO ] State equation strengthened by 3066 read => feed constraints.
[2024-06-07 08:48:04] [INFO ] After 5422ms SMT Verify possible using 3066 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-07 08:48:06] [INFO ] Deduced a trap composed of 5 places in 2323 ms of which 1 ms to minimize.
[2024-06-07 08:48:09] [INFO ] Deduced a trap composed of 6 places in 2079 ms of which 0 ms to minimize.
[2024-06-07 08:48:11] [INFO ] Deduced a trap composed of 7 places in 1965 ms of which 1 ms to minimize.
[2024-06-07 08:48:13] [INFO ] Deduced a trap composed of 6 places in 1913 ms of which 1 ms to minimize.
[2024-06-07 08:48:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 8857 ms
[2024-06-07 08:48:15] [INFO ] Deduced a trap composed of 5 places in 2075 ms of which 1 ms to minimize.
[2024-06-07 08:48:17] [INFO ] Deduced a trap composed of 5 places in 1884 ms of which 0 ms to minimize.
[2024-06-07 08:48:19] [INFO ] Deduced a trap composed of 6 places in 2089 ms of which 0 ms to minimize.
[2024-06-07 08:48:21] [INFO ] Deduced a trap composed of 5 places in 1589 ms of which 1 ms to minimize.
[2024-06-07 08:48:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 8188 ms
[2024-06-07 08:48:21] [INFO ] After 22521ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2024-06-07 08:48:21] [INFO ] After 24839ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) p2), true, (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND p0 p1 p2 (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND p0 p2 (NOT p3)))), (F (AND (NOT p0) p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 349 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 8796/8796 transitions.
Applied a total of 0 rules in 54 ms. Remains 119 /119 variables (removed 0) and now considering 8796/8796 (removed 0) transitions.
// Phase 1: matrix 8796 rows 119 cols
[2024-06-07 08:48:22] [INFO ] Computed 0 invariants in 99 ms
[2024-06-07 08:48:24] [INFO ] Implicit Places using invariants in 1723 ms returned []
[2024-06-07 08:48:24] [INFO ] Invariant cache hit.
[2024-06-07 08:48:25] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
[2024-06-07 08:48:25] [INFO ] Invariant cache hit.
[2024-06-07 08:48:29] [INFO ] Dead Transitions using invariants and state equation in 4545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7544 ms. Remains : 119/119 places, 8796/8796 transitions.
Computed a total of 40 stabilizing places and 50 stable transitions
Graph (complete) has 903 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.112 ms
Computed a total of 40 stabilizing places and 50 stable transitions
Detected a total of 40/119 stabilizing places and 50/8796 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2 (NOT p3)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-07 08:48:31] [INFO ] Invariant cache hit.
[2024-06-07 08:48:31] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 08:48:36] [INFO ] After 4591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 08:48:37] [INFO ] After 5990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 709 ms.
[2024-06-07 08:48:38] [INFO ] After 6765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 234 ms.
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 8796/8796 transitions.
Graph (trivial) has 80 edges and 119 vertex of which 21 / 119 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 871 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 103 transition count 8741
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 57 place count 81 transition count 8740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 80 transition count 8740
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 80 transition count 8738
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 78 transition count 8738
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 98 place count 60 transition count 8720
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 3 with 256 rules applied. Total rules applied 354 place count 60 transition count 8464
Free-agglomeration rule applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 367 place count 60 transition count 8451
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 3 with 1549 rules applied. Total rules applied 1916 place count 47 transition count 6915
Drop transitions removed 769 transitions
Redundant transition composition rules discarded 769 transitions
Iterating global reduction 4 with 769 rules applied. Total rules applied 2685 place count 47 transition count 6146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2686 place count 46 transition count 6145
Applied a total of 2686 rules in 41365 ms. Remains 46 /119 variables (removed 73) and now considering 6145/8796 (removed 2651) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41365 ms. Remains : 46/119 places, 6145/8796 transitions.
Finished random walk after 38 steps, including 0 resets, run visited all 3 properties in 30 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2 (NOT p3)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (F (AND p0 p1 p2 (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2979 ms.
Product exploration explored 100000 steps with 0 reset in 3014 ms.
Built C files in :
/tmp/ltsmin1336765184399044424
[2024-06-07 08:49:27] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1336765184399044424
Running compilation step : cd /tmp/ltsmin1336765184399044424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1336765184399044424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1336765184399044424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 8796/8796 transitions.
Applied a total of 0 rules in 57 ms. Remains 119 /119 variables (removed 0) and now considering 8796/8796 (removed 0) transitions.
[2024-06-07 08:49:30] [INFO ] Invariant cache hit.
[2024-06-07 08:49:32] [INFO ] Implicit Places using invariants in 1633 ms returned []
[2024-06-07 08:49:32] [INFO ] Invariant cache hit.
[2024-06-07 08:49:33] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 2911 ms to find 0 implicit places.
[2024-06-07 08:49:33] [INFO ] Invariant cache hit.
[2024-06-07 08:49:38] [INFO ] Dead Transitions using invariants and state equation in 4954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7923 ms. Remains : 119/119 places, 8796/8796 transitions.
Built C files in :
/tmp/ltsmin12831962516437876634
[2024-06-07 08:49:38] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12831962516437876634
Running compilation step : cd /tmp/ltsmin12831962516437876634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12831962516437876634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12831962516437876634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 08:49:43] [INFO ] Flatten gal took : 1534 ms
[2024-06-07 08:49:45] [INFO ] Flatten gal took : 1309 ms
[2024-06-07 08:49:45] [INFO ] Time to serialize gal into /tmp/LTL9576038364359929668.gal : 157 ms
[2024-06-07 08:49:45] [INFO ] Time to serialize properties into /tmp/LTL17015565958446580731.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9576038364359929668.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1161101811671666249.hoa' '-atoms' '/tmp/LTL17015565958446580731.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17015565958446580731.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1161101811671666249.hoa
Detected timeout of ITS tools.
[2024-06-07 08:50:02] [INFO ] Flatten gal took : 1399 ms
[2024-06-07 08:50:03] [INFO ] Flatten gal took : 1298 ms
[2024-06-07 08:50:04] [INFO ] Time to serialize gal into /tmp/LTL14894278659889268600.gal : 162 ms
[2024-06-07 08:50:04] [INFO ] Time to serialize properties into /tmp/LTL3645120089536399855.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14894278659889268600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3645120089536399855.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((p271==0)||(p42==1))"))||((("(p80==1)")&&(F("((p271==0)||(p42==1))")))&&(("((p213==0)||(p75==1))")U("(p235==1)")))))))...157
Formula 0 simplified : XXXG(F!"((p271==0)||(p42==1))" & (!"(p80==1)" | G!"((p271==0)||(p42==1))" | (!"((p213==0)||(p75==1))" R !"(p235==1)")))
Detected timeout of ITS tools.
[2024-06-07 08:50:20] [INFO ] Flatten gal took : 1297 ms
[2024-06-07 08:50:20] [INFO ] Applying decomposition
[2024-06-07 08:50:21] [INFO ] Flatten gal took : 1308 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13491235475656713819.txt' '-o' '/tmp/graph13491235475656713819.bin' '-w' '/tmp/graph13491235475656713819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13491235475656713819.bin' '-l' '-1' '-v' '-w' '/tmp/graph13491235475656713819.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:50:24] [INFO ] Decomposing Gal with order
[2024-06-07 08:50:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:50:27] [INFO ] Removed a total of 93759 redundant transitions.
[2024-06-07 08:50:28] [INFO ] Flatten gal took : 2279 ms
[2024-06-07 08:50:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 684 ms.
[2024-06-07 08:50:29] [INFO ] Time to serialize gal into /tmp/LTL16465488127193290454.gal : 64 ms
[2024-06-07 08:50:29] [INFO ] Time to serialize properties into /tmp/LTL2374809728180123085.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16465488127193290454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2374809728180123085.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((i2.u29.p271==0)||(i0.i0.u7.p42==1))"))||((("(i0.i2.u14.p80==1)")&&(F("((i2.u29.p271==0)||(i0.i0.u7.p42==1))")))&&(("(...220
Formula 0 simplified : XXXG(F!"((i2.u29.p271==0)||(i0.i0.u7.p42==1))" & (!"(i0.i2.u14.p80==1)" | G!"((i2.u29.p271==0)||(i0.i0.u7.p42==1))" | (!"((i3.u24.p2...205
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5720822049338431946
[2024-06-07 08:50:44] [INFO ] Built C files in 291ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5720822049338431946
Running compilation step : cd /tmp/ltsmin5720822049338431946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5720822049338431946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5720822049338431946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-08 finished in 245127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Graph (trivial) has 104 edges and 141 vertex of which 24 / 141 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1098 edges and 125 vertex of which 117 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.42 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 116 transition count 9208
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 98 transition count 9208
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 38 place count 98 transition count 9197
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 60 place count 87 transition count 9197
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 80 transition count 9190
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 80 transition count 9190
Performed 15 Post agglomeration using F-continuation condition with reduction of 432 identical transitions.
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 104 place count 65 transition count 8743
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 2 with 256 rules applied. Total rules applied 360 place count 65 transition count 8487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 366 place count 62 transition count 8495
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 367 place count 62 transition count 8494
Applied a total of 367 rules in 56785 ms. Remains 62 /141 variables (removed 79) and now considering 8494/9250 (removed 756) transitions.
[2024-06-07 08:51:44] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
// Phase 1: matrix 8487 rows 62 cols
[2024-06-07 08:51:44] [INFO ] Computed 0 invariants in 45 ms
[2024-06-07 08:51:46] [INFO ] Implicit Places using invariants in 1856 ms returned []
[2024-06-07 08:51:46] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:51:46] [INFO ] Invariant cache hit.
[2024-06-07 08:51:47] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 3106 ms to find 0 implicit places.
[2024-06-07 08:52:12] [INFO ] Redundant transitions in 25528 ms returned []
[2024-06-07 08:52:12] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:52:12] [INFO ] Invariant cache hit.
[2024-06-07 08:52:17] [INFO ] Dead Transitions using invariants and state equation in 4275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/141 places, 8494/9250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89709 ms. Remains : 62/141 places, 8494/9250 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 57 ms.
Computed a total of 9 stabilizing places and 30 stable transitions
Computed a total of 9 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1114 resets, run finished after 709 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Finished probabilistic random walk after 337 steps, run visited all 1 properties in 22 ms. (steps per millisecond=15 )
Probabilistic random walk after 337 steps, saw 321 distinct states, run finished after 23 ms. (steps per millisecond=14 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 8494/8494 transitions.
Applied a total of 0 rules in 27109 ms. Remains 62 /62 variables (removed 0) and now considering 8494/8494 (removed 0) transitions.
[2024-06-07 08:52:45] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:52:45] [INFO ] Invariant cache hit.
[2024-06-07 08:52:47] [INFO ] Implicit Places using invariants in 1748 ms returned []
[2024-06-07 08:52:47] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:52:47] [INFO ] Invariant cache hit.
[2024-06-07 08:52:48] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 2964 ms to find 0 implicit places.
[2024-06-07 08:53:15] [INFO ] Redundant transitions in 26402 ms returned []
[2024-06-07 08:53:15] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:53:15] [INFO ] Invariant cache hit.
[2024-06-07 08:53:19] [INFO ] Dead Transitions using invariants and state equation in 4607 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61096 ms. Remains : 62/62 places, 8494/8494 transitions.
Computed a total of 9 stabilizing places and 30 stable transitions
Computed a total of 9 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Finished random walk after 189 steps, including 20 resets, run visited all 1 properties in 22 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 51 ms.
Built C files in :
/tmp/ltsmin17412733555748016643
[2024-06-07 08:53:20] [INFO ] Too many transitions (8494) to apply POR reductions. Disabling POR matrices.
[2024-06-07 08:53:20] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17412733555748016643
Running compilation step : cd /tmp/ltsmin17412733555748016643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17412733555748016643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17412733555748016643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 8494/8494 transitions.
Applied a total of 0 rules in 26724 ms. Remains 62 /62 variables (removed 0) and now considering 8494/8494 (removed 0) transitions.
[2024-06-07 08:53:50] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:53:50] [INFO ] Invariant cache hit.
[2024-06-07 08:53:52] [INFO ] Implicit Places using invariants in 1777 ms returned []
[2024-06-07 08:53:52] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:53:52] [INFO ] Invariant cache hit.
[2024-06-07 08:53:53] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 3015 ms to find 0 implicit places.
[2024-06-07 08:54:22] [INFO ] Redundant transitions in 28720 ms returned []
[2024-06-07 08:54:22] [INFO ] Flow matrix only has 8487 transitions (discarded 7 similar events)
[2024-06-07 08:54:22] [INFO ] Invariant cache hit.
[2024-06-07 08:54:27] [INFO ] Dead Transitions using invariants and state equation in 5314 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63788 ms. Remains : 62/62 places, 8494/8494 transitions.
Built C files in :
/tmp/ltsmin17341121456170650375
[2024-06-07 08:54:27] [INFO ] Too many transitions (8494) to apply POR reductions. Disabling POR matrices.
[2024-06-07 08:54:27] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17341121456170650375
Running compilation step : cd /tmp/ltsmin17341121456170650375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17341121456170650375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17341121456170650375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 08:54:32] [INFO ] Flatten gal took : 927 ms
[2024-06-07 08:54:33] [INFO ] Flatten gal took : 849 ms
[2024-06-07 08:54:33] [INFO ] Time to serialize gal into /tmp/LTL12959094425014392176.gal : 127 ms
[2024-06-07 08:54:33] [INFO ] Time to serialize properties into /tmp/LTL8464176378347888004.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12959094425014392176.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11520114551052490435.hoa' '-atoms' '/tmp/LTL8464176378347888004.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8464176378347888004.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11520114551052490435.hoa
Detected timeout of ITS tools.
[2024-06-07 08:54:50] [INFO ] Flatten gal took : 846 ms
[2024-06-07 08:54:51] [INFO ] Flatten gal took : 995 ms
[2024-06-07 08:54:51] [INFO ] Time to serialize gal into /tmp/LTL16477493006768589585.gal : 106 ms
[2024-06-07 08:54:51] [INFO ] Time to serialize properties into /tmp/LTL8723764290312348006.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16477493006768589585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8723764290312348006.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p53==0)||(p191==1))"))))
Formula 0 simplified : FG!"((p53==0)||(p191==1))"
Detected timeout of ITS tools.
[2024-06-07 08:55:07] [INFO ] Flatten gal took : 870 ms
[2024-06-07 08:55:07] [INFO ] Applying decomposition
[2024-06-07 08:55:08] [INFO ] Flatten gal took : 900 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7026148124523029823.txt' '-o' '/tmp/graph7026148124523029823.bin' '-w' '/tmp/graph7026148124523029823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7026148124523029823.bin' '-l' '-1' '-v' '-w' '/tmp/graph7026148124523029823.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:55:10] [INFO ] Decomposing Gal with order
[2024-06-07 08:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:55:12] [INFO ] Removed a total of 84393 redundant transitions.
[2024-06-07 08:55:13] [INFO ] Flatten gal took : 1717 ms
[2024-06-07 08:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 474 ms.
[2024-06-07 08:55:13] [INFO ] Time to serialize gal into /tmp/LTL17696736505470413073.gal : 71 ms
[2024-06-07 08:55:13] [INFO ] Time to serialize properties into /tmp/LTL11869212789269770175.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17696736505470413073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11869212789269770175.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((u1.p53==0)||(i2.u7.p191==1))"))))
Formula 0 simplified : FG!"((u1.p53==0)||(i2.u7.p191==1))"
Reverse transition relation is NOT exact ! Due to transitions t38, t43_t45, t25_t28, t8_t11, t17_t19_t20_t23, t7_t16_t24_t33_t42_t48_t57_t68_t89_t90_t69_t7...1598
Computing Next relation with stutter on 10 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
407 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.28103,75572,1,0,20528,2035,77446,133296,512,7224,370135
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-13 finished in 273901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 9250
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 121 transition count 9231
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 121 transition count 9231
Ensure Unique test removed 561 transitions
Reduce isomorphic transitions removed 561 transitions.
Iterating post reduction 1 with 561 rules applied. Total rules applied 600 place count 121 transition count 8670
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 605 place count 116 transition count 8665
Iterating global reduction 2 with 5 rules applied. Total rules applied 610 place count 116 transition count 8665
Applied a total of 610 rules in 224 ms. Remains 116 /141 variables (removed 25) and now considering 8665/9250 (removed 585) transitions.
// Phase 1: matrix 8665 rows 116 cols
[2024-06-07 08:55:21] [INFO ] Computed 0 invariants in 155 ms
[2024-06-07 08:55:23] [INFO ] Implicit Places using invariants in 1993 ms returned []
[2024-06-07 08:55:23] [INFO ] Invariant cache hit.
[2024-06-07 08:55:24] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 3234 ms to find 0 implicit places.
[2024-06-07 08:55:24] [INFO ] Invariant cache hit.
[2024-06-07 08:55:29] [INFO ] Dead Transitions using invariants and state equation in 4847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/141 places, 8665/9250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8314 ms. Remains : 116/141 places, 8665/9250 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-15 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:(AND (EQ s55 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2903 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 1 ms.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-15 finished in 11443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)||(p1&&F(p0)&&(p2 U p3))))))))'
Found a Shortening insensitive property : ResIsolation-PT-N08P2-LTLCardinality-08
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 141/141 places, 9250/9250 transitions.
Graph (trivial) has 96 edges and 141 vertex of which 21 / 141 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1100 edges and 127 vertex of which 119 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.53 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 118 transition count 9212
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 102 transition count 9210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 100 transition count 9210
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 38 place count 100 transition count 9199
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 60 place count 89 transition count 9199
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 66 place count 83 transition count 9193
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 83 transition count 9193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 83 transition count 9192
Performed 14 Post agglomeration using F-continuation condition with reduction of 368 identical transitions.
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 101 place count 69 transition count 8810
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 165 place count 69 transition count 8746
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 171 place count 66 transition count 8754
Applied a total of 171 rules in 1575 ms. Remains 66 /141 variables (removed 75) and now considering 8754/9250 (removed 496) transitions.
[2024-06-07 08:55:34] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
// Phase 1: matrix 8748 rows 66 cols
[2024-06-07 08:55:34] [INFO ] Computed 0 invariants in 59 ms
[2024-06-07 08:55:36] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2024-06-07 08:55:36] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:55:36] [INFO ] Invariant cache hit.
[2024-06-07 08:55:37] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2024-06-07 08:55:37] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:55:37] [INFO ] Invariant cache hit.
[2024-06-07 08:55:42] [INFO ] Dead Transitions using invariants and state equation in 4447 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 66/141 places, 8754/9250 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8977 ms. Remains : 66/141 places, 8754/9250 transitions.
Running random walk in product with property : ResIsolation-PT-N08P2-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(EQ s25 1), p0:(OR (EQ s59 0) (EQ s12 1)), p3:(EQ s49 1), p2:(OR (EQ s45 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 1637 ms.
Computed a total of 9 stabilizing places and 30 stable transitions
Computed a total of 9 stabilizing places and 30 stable transitions
Detected a total of 9/66 stabilizing places and 30/8754 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) p2), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 694 ms. (steps per millisecond=14 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-07 08:55:49] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:55:49] [INFO ] Invariant cache hit.
[2024-06-07 08:55:49] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-07 08:55:53] [INFO ] After 3901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-07 08:56:10] [INFO ] State equation strengthened by 8682 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 08:56:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 08:56:14] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 8754/8754 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 66 transition count 8741
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 63 transition count 8738
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 1 with 256 rules applied. Total rules applied 275 place count 63 transition count 8482
Free-agglomeration rule applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 288 place count 63 transition count 8469
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 1 with 1549 rules applied. Total rules applied 1837 place count 50 transition count 6933
Drop transitions removed 769 transitions
Redundant transition composition rules discarded 769 transitions
Iterating global reduction 2 with 769 rules applied. Total rules applied 2606 place count 50 transition count 6164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2607 place count 49 transition count 6163
Applied a total of 2607 rules in 43674 ms. Remains 49 /66 variables (removed 17) and now considering 6163/8754 (removed 2591) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43675 ms. Remains : 49/66 places, 6163/8754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Probably explored full state space saw : 7293 states, properties seen :4
Probabilistic random walk after 21289 steps, saw 7293 distinct states, run finished after 1107 ms. (steps per millisecond=19 ) properties seen :4
Explored full state space saw : 7293 states, properties seen :0
Exhaustive walk after 21289 steps, saw 7293 distinct states, run finished after 1050 ms. (steps per millisecond=20 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) p2), true, (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND p0 p1 p2 (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND p0 p2 (NOT p3)))), (F (AND (NOT p0) p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 368 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 8754/8754 transitions.
Applied a total of 0 rules in 48 ms. Remains 66 /66 variables (removed 0) and now considering 8754/8754 (removed 0) transitions.
[2024-06-07 08:57:05] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:57:05] [INFO ] Invariant cache hit.
[2024-06-07 08:57:06] [INFO ] Implicit Places using invariants in 1639 ms returned []
[2024-06-07 08:57:06] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:57:06] [INFO ] Invariant cache hit.
[2024-06-07 08:57:08] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
[2024-06-07 08:57:08] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:57:08] [INFO ] Invariant cache hit.
[2024-06-07 08:57:12] [INFO ] Dead Transitions using invariants and state equation in 4434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7428 ms. Remains : 66/66 places, 8754/8754 transitions.
Computed a total of 9 stabilizing places and 30 stable transitions
Computed a total of 9 stabilizing places and 30 stable transitions
Detected a total of 9/66 stabilizing places and 30/8754 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2 (NOT p3)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-07 08:57:15] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:57:15] [INFO ] Invariant cache hit.
[2024-06-07 08:57:15] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 08:57:18] [INFO ] After 3088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 08:57:32] [INFO ] State equation strengthened by 8682 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 08:57:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 08:57:40] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1502 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 8754/8754 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 66 transition count 8740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 65 transition count 8740
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 61 transition count 8736
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 2 with 256 rules applied. Total rules applied 279 place count 61 transition count 8480
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 292 place count 61 transition count 8467
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 2 with 1549 rules applied. Total rules applied 1841 place count 48 transition count 6931
Drop transitions removed 769 transitions
Redundant transition composition rules discarded 769 transitions
Iterating global reduction 3 with 769 rules applied. Total rules applied 2610 place count 48 transition count 6162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2611 place count 47 transition count 6161
Applied a total of 2611 rules in 42977 ms. Remains 47 /66 variables (removed 19) and now considering 6161/8754 (removed 2593) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42978 ms. Remains : 47/66 places, 6161/8754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Finished probabilistic random walk after 8228 steps, run visited all 3 properties in 339 ms. (steps per millisecond=24 )
Probabilistic random walk after 8228 steps, saw 4378 distinct states, run finished after 339 ms. (steps per millisecond=24 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2 (NOT p3)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (F (AND p0 p1 p2 (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 280 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1527 ms.
Product exploration explored 100000 steps with 0 reset in 66 ms.
Built C files in :
/tmp/ltsmin6705611640324490764
[2024-06-07 08:58:30] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6705611640324490764
Running compilation step : cd /tmp/ltsmin6705611640324490764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6705611640324490764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6705611640324490764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 8754/8754 transitions.
Applied a total of 0 rules in 50 ms. Remains 66 /66 variables (removed 0) and now considering 8754/8754 (removed 0) transitions.
[2024-06-07 08:58:33] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:58:33] [INFO ] Invariant cache hit.
[2024-06-07 08:58:34] [INFO ] Implicit Places using invariants in 1630 ms returned []
[2024-06-07 08:58:34] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:58:34] [INFO ] Invariant cache hit.
[2024-06-07 08:58:36] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
[2024-06-07 08:58:36] [INFO ] Flow matrix only has 8748 transitions (discarded 6 similar events)
[2024-06-07 08:58:36] [INFO ] Invariant cache hit.
[2024-06-07 08:58:41] [INFO ] Dead Transitions using invariants and state equation in 5142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8113 ms. Remains : 66/66 places, 8754/8754 transitions.
Built C files in :
/tmp/ltsmin11322296237466888079
[2024-06-07 08:58:41] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11322296237466888079
Running compilation step : cd /tmp/ltsmin11322296237466888079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11322296237466888079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11322296237466888079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 08:58:46] [INFO ] Flatten gal took : 1003 ms
[2024-06-07 08:58:47] [INFO ] Flatten gal took : 1044 ms
[2024-06-07 08:58:47] [INFO ] Time to serialize gal into /tmp/LTL3124167813807685191.gal : 122 ms
[2024-06-07 08:58:47] [INFO ] Time to serialize properties into /tmp/LTL10396646928586164105.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3124167813807685191.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13783426057173239544.hoa' '-atoms' '/tmp/LTL10396646928586164105.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10396646928586164105.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13783426057173239544.hoa
Detected timeout of ITS tools.
[2024-06-07 08:59:04] [INFO ] Flatten gal took : 1079 ms
[2024-06-07 08:59:05] [INFO ] Flatten gal took : 968 ms
[2024-06-07 08:59:06] [INFO ] Time to serialize gal into /tmp/LTL7219612530984356645.gal : 117 ms
[2024-06-07 08:59:06] [INFO ] Time to serialize properties into /tmp/LTL7191494793736660614.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7219612530984356645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7191494793736660614.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((p271==0)||(p42==1))"))||((("(p80==1)")&&(F("((p271==0)||(p42==1))")))&&(("((p213==0)||(p75==1))")U("(p235==1)")))))))...157
Formula 0 simplified : XXXG(F!"((p271==0)||(p42==1))" & (!"(p80==1)" | G!"((p271==0)||(p42==1))" | (!"((p213==0)||(p75==1))" R !"(p235==1)")))
Detected timeout of ITS tools.
[2024-06-07 08:59:22] [INFO ] Flatten gal took : 944 ms
[2024-06-07 08:59:22] [INFO ] Applying decomposition
[2024-06-07 08:59:23] [INFO ] Flatten gal took : 896 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8758499996649692342.txt' '-o' '/tmp/graph8758499996649692342.bin' '-w' '/tmp/graph8758499996649692342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8758499996649692342.bin' '-l' '-1' '-v' '-w' '/tmp/graph8758499996649692342.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:59:25] [INFO ] Decomposing Gal with order
[2024-06-07 08:59:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:59:27] [INFO ] Removed a total of 89257 redundant transitions.
[2024-06-07 08:59:27] [INFO ] Flatten gal took : 1582 ms
[2024-06-07 08:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 678 ms.
[2024-06-07 08:59:28] [INFO ] Time to serialize gal into /tmp/LTL4626087651699277609.gal : 106 ms
[2024-06-07 08:59:28] [INFO ] Time to serialize properties into /tmp/LTL13585996033433141510.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4626087651699277609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13585996033433141510.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((i1.u12.p271==0)||(u0.p42==1))"))||((("(u0.p80==1)")&&(F("((i1.u12.p271==0)||(u0.p42==1))")))&&(("((u8.p213==0)||(i1.u...195
Formula 0 simplified : XXXG(F!"((i1.u12.p271==0)||(u0.p42==1))" & (!"(u0.p80==1)" | G!"((i1.u12.p271==0)||(u0.p42==1))" | (!"((u8.p213==0)||(i1.u2.p75==1))...180
Reverse transition relation is NOT exact ! Due to transitions t29, t93_t94_t95_t96, t73_t74_t75_t76, t25_t28, t8_t11, t17_t19_t20_t23, t7_t16_t24_t33_t42_t...1409
Computing Next relation with stutter on 10 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11816086859508249428
[2024-06-07 08:59:43] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11816086859508249428
Running compilation step : cd /tmp/ltsmin11816086859508249428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11816086859508249428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11816086859508249428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ResIsolation-PT-N08P2-LTLCardinality-08 finished in 253848 ms.
[2024-06-07 08:59:48] [INFO ] Flatten gal took : 1515 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin951483257689817703
[2024-06-07 08:59:48] [INFO ] Too many transitions (9250) to apply POR reductions. Disabling POR matrices.
[2024-06-07 08:59:49] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin951483257689817703
Running compilation step : cd /tmp/ltsmin951483257689817703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-07 08:59:49] [INFO ] Applying decomposition
[2024-06-07 08:59:50] [INFO ] Flatten gal took : 1420 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8171483936126485659.txt' '-o' '/tmp/graph8171483936126485659.bin' '-w' '/tmp/graph8171483936126485659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8171483936126485659.bin' '-l' '-1' '-v' '-w' '/tmp/graph8171483936126485659.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:59:54] [INFO ] Decomposing Gal with order
[2024-06-07 08:59:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:59:58] [INFO ] Removed a total of 95735 redundant transitions.
[2024-06-07 08:59:59] [INFO ] Flatten gal took : 4070 ms
[2024-06-07 09:00:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2794 labels/synchronizations in 1130 ms.
[2024-06-07 09:00:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality10848779599627834972.gal : 77 ms
[2024-06-07 09:00:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality11452476293963955249.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10848779599627834972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11452476293963955249.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((i2.u4.p271==0)||(i0.i3.u7.p42==1))"))||((("(i0.i2.i1.u13.p80==1)")&&(F("((i2.u4.p271==0)||(i0.i3.u7.p42==1))")))&&(("...221
Formula 0 simplified : XXXG(F!"((i2.u4.p271==0)||(i0.i3.u7.p42==1))" & (!"(i0.i2.i1.u13.p80==1)" | G!"((i2.u4.p271==0)||(i0.i3.u7.p42==1))" | (!"((i4.u30.p...206
Compilation finished in 124730 ms.
Running link step : cd /tmp/ltsmin951483257689817703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 161 ms.
Running LTSmin : cd /tmp/ltsmin951483257689817703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp0==true))&&((LTLAPp2==true) U (LTLAPp3==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t4, t11, t12, t13, t20, t29, t31, t38, t39, t52, t53, t62, t63, t66, t76, t86, t88, t96, i0.t...481
Computing Next relation with stutter on 10 deadlock states
Detected timeout of ITS tools.
[2024-06-07 09:29:18] [INFO ] Applying decomposition
[2024-06-07 09:29:24] [INFO ] Flatten gal took : 5385 ms
[2024-06-07 09:29:26] [INFO ] Decomposing Gal with order
[2024-06-07 09:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 09:29:35] [INFO ] Removed a total of 91236 redundant transitions.
[2024-06-07 09:29:36] [INFO ] Flatten gal took : 6216 ms
[2024-06-07 09:29:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 6158 ms.
[2024-06-07 09:29:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality9118698797917346310.gal : 257 ms
[2024-06-07 09:29:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality10224792564338435803.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9118698797917346310.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10224792564338435803.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((i0.u17.p271==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u9.p42==1))"))||((("(i0.i0.i0.i0.i0.i0.i0.i0.u10.p80==1)")&&(F("((i0.u17.p2...304
Formula 0 simplified : XXXG(F!"((i0.u17.p271==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u9.p42==1))" & (!"(i0.i0.i0.i0.i0.i0.i0.i0.u10.p80==1)" | G!"((i0.u17.p271==0)||...289
Reverse transition relation is NOT exact ! Due to transitions t2, u18.t4, i0.u17.t11, i0.u17.t12, i0.u17.t13, i0.u17.t9247, i0.i0.t18, i0.i0.u16.t20, i0.i0...962
Computing Next relation with stutter on 10 deadlock states
56 unique states visited
55 strongly connected components in search stack
58 transitions explored
56 items max in DFS search stack
3569 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,42.655,471792,1,0,471489,19217,147300,1.12524e+06,1342,88086,571026
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResIsolation-PT-N08P2-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3554115 ms.
BK_STOP 1717752684712
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResIsolation-PT-N08P2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ResIsolation-PT-N08P2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r649-smll-171774451500007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResIsolation-PT-N08P2.tgz
mv ResIsolation-PT-N08P2 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;