About the Execution of LoLa+red for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2049.067 | 1853411.00 | 1980620.00 | 6686.60 | FFFF?F?FTT??FTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414500492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DoubleExponent-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414500492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:22 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 DoubleExponent-PT-100-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678360097698
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 11:08:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 11:08:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:08:21] [INFO ] Load time of PNML (sax parser for PT used): 540 ms
[2023-03-09 11:08:21] [INFO ] Transformed 5304 places.
[2023-03-09 11:08:21] [INFO ] Transformed 4998 transitions.
[2023-03-09 11:08:21] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 740 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1585 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:08:25] [INFO ] Invariants computation overflowed in 280 ms
[2023-03-09 11:08:26] [INFO ] Implicit Places using invariants in 1609 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:08:26] [INFO ] Invariants computation overflowed in 128 ms
[2023-03-09 11:08:28] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:08:28] [INFO ] Invariants computation overflowed in 230 ms
[2023-03-09 11:08:29] [INFO ] Dead Transitions using invariants and state equation in 1163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6679 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 45 out of 5300 places after structural reductions.
[2023-03-09 11:08:31] [INFO ] Flatten gal took : 617 ms
[2023-03-09 11:08:31] [INFO ] Flatten gal took : 295 ms
[2023-03-09 11:08:32] [INFO ] Input system was already deterministic with 4998 transitions.
Support contains 42 out of 5300 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 323 resets, run finished after 838 ms. (steps per millisecond=11 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 36736 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36736 steps, saw 18378 distinct states, run finished after 3003 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:08:38] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-09 11:09:04] [INFO ] After 16120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27 real:1
[2023-03-09 11:09:04] [INFO ] After 16132ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :27 real:1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 11:09:04] [INFO ] After 25057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :27 real:1
[2023-03-09 11:09:29] [INFO ] After 17800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-09 11:09:29] [INFO ] After 17802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 11:09:29] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 42 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1152 transitions
Trivial Post-agglo rules discarded 1152 transitions
Performed 1152 trivial Post agglomeration. Transition count delta: 1152
Iterating post reduction 0 with 1155 rules applied. Total rules applied 1156 place count 5297 transition count 3844
Reduce places removed 1152 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 1166 rules applied. Total rules applied 2322 place count 4145 transition count 3830
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 2336 place count 4131 transition count 3830
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 2336 place count 4131 transition count 3627
Deduced a syphon composed of 203 places in 227 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 2742 place count 3928 transition count 3627
Performed 886 Post agglomeration using F-continuation condition.Transition count delta: 886
Deduced a syphon composed of 886 places in 204 ms
Reduce places removed 886 places and 0 transitions.
Iterating global reduction 3 with 1772 rules applied. Total rules applied 4514 place count 3042 transition count 2741
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 92 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4716 place count 2941 transition count 2741
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 128 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 4902 place count 2848 transition count 2741
Free-agglomeration rule (complex) applied 401 times.
Iterating global reduction 3 with 401 rules applied. Total rules applied 5303 place count 2848 transition count 2340
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 5704 place count 2447 transition count 2340
Partial Free-agglomeration rule applied 405 times.
Drop transitions removed 405 transitions
Iterating global reduction 4 with 405 rules applied. Total rules applied 6109 place count 2447 transition count 2340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6110 place count 2446 transition count 2339
Applied a total of 6110 rules in 4074 ms. Remains 2446 /5300 variables (removed 2854) and now considering 2339/4998 (removed 2659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4075 ms. Remains : 2446/5300 places, 2339/4998 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 55696 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55696 steps, saw 27887 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-09 11:09:37] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-09 11:10:02] [INFO ] After 22317ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27 real:1
[2023-03-09 11:10:02] [INFO ] State equation strengthened by 390 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 11:10:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:10:02] [INFO ] After 25052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 2446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2446/2446 places, 2339/2339 transitions.
Applied a total of 0 rules in 214 ms. Remains 2446 /2446 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 2446/2446 places, 2339/2339 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2446/2446 places, 2339/2339 transitions.
Applied a total of 0 rules in 217 ms. Remains 2446 /2446 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-09 11:10:03] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:10:13] [INFO ] Implicit Places using invariants in 10469 ms returned []
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-09 11:10:13] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 11:10:14] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 11590 ms to find 0 implicit places.
[2023-03-09 11:10:14] [INFO ] Redundant transitions in 189 ms returned []
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-09 11:10:14] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-09 11:10:18] [INFO ] Dead Transitions using invariants and state equation in 3117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15127 ms. Remains : 2446/2446 places, 2339/2339 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.64 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(G(p1)||(p1&&F(p2)))))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1355 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:19] [INFO ] Invariants computation overflowed in 185 ms
[2023-03-09 11:10:20] [INFO ] Implicit Places using invariants in 898 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:20] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:10:22] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2631 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:22] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:10:23] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4917 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 394 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s3932 1), p1:(GEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-01 finished in 6158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0)) U p1)) U X(X(p2))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1164 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:25] [INFO ] Invariants computation overflowed in 191 ms
[2023-03-09 11:10:26] [INFO ] Implicit Places using invariants in 1283 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:27] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-09 11:10:28] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 3106 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:28] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-09 11:10:29] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5212 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 416 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 7}, { cond=(NOT p2), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 7}, { cond=true, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s234 1) (GEQ s304 1)), p2:(GEQ s5037 1), p0:(AND (GEQ s2309 1) (GEQ s2317 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-02 finished in 6183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Support contains 7 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1190 transitions
Trivial Post-agglo rules discarded 1190 transitions
Performed 1190 trivial Post agglomeration. Transition count delta: 1190
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1190 place count 5299 transition count 3807
Reduce places removed 1190 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2384 place count 4109 transition count 3803
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2388 place count 4105 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3602
Deduced a syphon composed of 201 places in 403 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 94 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 88 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 125 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2700
Applied a total of 4989 rules in 2553 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:10:33] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:10:36] [INFO ] Implicit Places using invariants in 3117 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:10:36] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-09 11:10:40] [INFO ] Implicit Places using invariants and state equation in 4125 ms returned []
Implicit Place search using SMT with State Equation took 7248 ms to find 0 implicit places.
[2023-03-09 11:10:40] [INFO ] Redundant transitions in 253 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:10:40] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-09 11:10:43] [INFO ] Dead Transitions using invariants and state equation in 2916 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12992 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1541 1), p1:(AND (GEQ s372 1) (GEQ s416 1)), p2:(AND (GEQ s632 1) (GEQ s639 1)), p3:(OR (LT s4 1) (LT s2764 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14006 reset in 665 ms.
Product exploration explored 100000 steps with 13880 reset in 556 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 455 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59937 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59937 steps, saw 29975 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:10:49] [INFO ] Invariants computation overflowed in 106 ms
[2023-03-09 11:11:14] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:11:39] [INFO ] After 23965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 11:11:39] [INFO ] State equation strengthened by 196 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 11:11:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:11:39] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 82 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 1075 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1075 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1241 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61373 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61373 steps, saw 30711 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:11:44] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-09 11:11:53] [INFO ] After 7559ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 11:11:53] [INFO ] State equation strengthened by 397 read => feed constraints.
[2023-03-09 11:12:02] [INFO ] After 9294ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:12:02] [INFO ] After 17695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:12:27] [INFO ] After 24130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 11:12:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:12:27] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1565 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 231 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 333 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:12:29] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-09 11:12:50] [INFO ] Implicit Places using invariants in 20699 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:12:50] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-09 11:13:09] [INFO ] Implicit Places using invariants and state equation in 19091 ms returned []
Implicit Place search using SMT with State Equation took 39806 ms to find 0 implicit places.
[2023-03-09 11:13:09] [INFO ] Redundant transitions in 202 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:13:09] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-09 11:13:12] [INFO ] Dead Transitions using invariants and state equation in 2920 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43293 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 645 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 374 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:13:14] [INFO ] Invariants computation overflowed in 107 ms
[2023-03-09 11:13:17] [INFO ] Implicit Places using invariants in 3260 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:13:17] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-09 11:13:18] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 4308 ms to find 0 implicit places.
[2023-03-09 11:13:18] [INFO ] Redundant transitions in 127 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:13:18] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 11:13:21] [INFO ] Dead Transitions using invariants and state equation in 2961 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7788 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 635 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 804 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 804 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 57244 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57244 steps, saw 28627 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:13:26] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 11:13:51] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:14:16] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 983 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 881 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67804 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67804 steps, saw 33916 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:14:21] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-09 11:14:30] [INFO ] After 7748ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 11:14:30] [INFO ] State equation strengthened by 397 read => feed constraints.
[2023-03-09 11:14:39] [INFO ] After 9198ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:14:39] [INFO ] After 17801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:15:04] [INFO ] After 24282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 11:15:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:15:04] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2003 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 346 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 209 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:15:07] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 11:15:27] [INFO ] Implicit Places using invariants in 20191 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:15:27] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-09 11:15:28] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 21309 ms to find 0 implicit places.
[2023-03-09 11:15:28] [INFO ] Redundant transitions in 112 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-09 11:15:28] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-09 11:15:32] [INFO ] Dead Transitions using invariants and state equation in 3335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24986 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 549 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 13807 reset in 402 ms.
Product exploration explored 100000 steps with 13901 reset in 312 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 205 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:15:34] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-09 11:15:37] [INFO ] Implicit Places using invariants in 3264 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:15:37] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-09 11:15:41] [INFO ] Implicit Places using invariants and state equation in 4451 ms returned []
Implicit Place search using SMT with State Equation took 7717 ms to find 0 implicit places.
[2023-03-09 11:15:41] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:15:41] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-09 11:15:44] [INFO ] Dead Transitions using invariants and state equation in 2986 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11046 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-04 finished in 315138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(p2))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 269 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 99 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 72 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 69 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4992 place count 2803 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4993 place count 2802 transition count 2698
Applied a total of 4993 rules in 1984 ms. Remains 2802 /5300 variables (removed 2498) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-09 11:15:47] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-09 11:15:51] [INFO ] Implicit Places using invariants in 3302 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-09 11:15:51] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-09 11:15:52] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 4410 ms to find 0 implicit places.
[2023-03-09 11:15:52] [INFO ] Redundant transitions in 202 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-09 11:15:52] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-09 11:15:55] [INFO ] Dead Transitions using invariants and state equation in 3188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2802/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9801 ms. Remains : 2802/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s2629 1), p0:(GEQ s917 1), p2:(GEQ s411 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-05 finished in 9936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 229 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 93 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4604 place count 2997 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 71 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4806 place count 2896 transition count 2695
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 76 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5000 place count 2799 transition count 2695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5001 place count 2798 transition count 2694
Applied a total of 5001 rules in 1945 ms. Remains 2798 /5300 variables (removed 2502) and now considering 2694/4998 (removed 2304) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:15:57] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 11:16:00] [INFO ] Implicit Places using invariants in 2803 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:16:00] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 11:16:04] [INFO ] Implicit Places using invariants and state equation in 4322 ms returned []
Implicit Place search using SMT with State Equation took 7151 ms to find 0 implicit places.
[2023-03-09 11:16:04] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:16:04] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:16:07] [INFO ] Dead Transitions using invariants and state equation in 2916 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2798/5300 places, 2694/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12162 ms. Remains : 2798/5300 places, 2694/4998 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-06 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:(LT s452 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 13909 reset in 486 ms.
Product exploration explored 100000 steps with 13793 reset in 383 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 228 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 106 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1397 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78619 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78619 steps, saw 39317 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:16:12] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:16:15] [INFO ] After 2163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 11:16:15] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-09 11:16:24] [INFO ] After 9297ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-09 11:16:24] [INFO ] After 11910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 1049 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1050 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102937 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102937 steps, saw 51514 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:16:28] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 11:16:41] [INFO ] After 12399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 294 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 402 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:16:41] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-09 11:17:12] [INFO ] Performed 1895/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:17:17] [INFO ] Implicit Places using invariants in 36178 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:17:18] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:17:49] [INFO ] Performed 1911/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:17:55] [INFO ] Implicit Places using invariants and state equation in 37087 ms returned []
Implicit Place search using SMT with State Equation took 73271 ms to find 0 implicit places.
[2023-03-09 11:17:55] [INFO ] Redundant transitions in 236 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:17:55] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-09 11:17:59] [INFO ] Dead Transitions using invariants and state equation in 3954 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77883 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 331 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:18:00] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-09 11:18:04] [INFO ] Implicit Places using invariants in 4400 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:18:04] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 11:18:05] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 5518 ms to find 0 implicit places.
[2023-03-09 11:18:05] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:18:05] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 11:18:09] [INFO ] Dead Transitions using invariants and state equation in 3491 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9477 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 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 103 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1387 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78493 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78493 steps, saw 39252 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:18:13] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 11:18:16] [INFO ] After 2802ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 11:18:16] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-09 11:18:25] [INFO ] After 9207ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-09 11:18:25] [INFO ] After 12574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 930 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 930 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93404 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93404 steps, saw 46743 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:18:29] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:18:43] [INFO ] After 13750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 307 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 371 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:18:44] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-09 11:19:14] [INFO ] Performed 2161/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:19:19] [INFO ] Implicit Places using invariants in 34926 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:19:19] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-09 11:19:50] [INFO ] Performed 1629/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:20:01] [INFO ] Implicit Places using invariants and state equation in 41757 ms returned []
Implicit Place search using SMT with State Equation took 76697 ms to find 0 implicit places.
[2023-03-09 11:20:01] [INFO ] Redundant transitions in 234 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-09 11:20:01] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-09 11:20:04] [INFO ] Dead Transitions using invariants and state equation in 2908 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80248 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13899 reset in 345 ms.
Product exploration explored 100000 steps with 13970 reset in 386 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 274 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:20:06] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 11:20:08] [INFO ] Implicit Places using invariants in 2596 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:20:08] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:20:12] [INFO ] Implicit Places using invariants and state equation in 4004 ms returned []
Implicit Place search using SMT with State Equation took 6634 ms to find 0 implicit places.
[2023-03-09 11:20:12] [INFO ] Redundant transitions in 128 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-09 11:20:12] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:20:15] [INFO ] Dead Transitions using invariants and state equation in 2566 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9636 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-06 finished in 260278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3597
Deduced a syphon composed of 202 places in 267 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 2800 place count 3899 transition count 3597
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 154 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 2 with 1800 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 134 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 78 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4996 place count 2801 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2696
Applied a total of 4997 rules in 2167 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-09 11:20:18] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 11:20:22] [INFO ] Implicit Places using invariants in 3917 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-09 11:20:22] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 11:20:23] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 4973 ms to find 0 implicit places.
[2023-03-09 11:20:23] [INFO ] Redundant transitions in 200 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-09 11:20:23] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-09 11:20:26] [INFO ] Dead Transitions using invariants and state equation in 3264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/5300 places, 2696/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10625 ms. Remains : 2800/5300 places, 2696/4998 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1811 1) (GEQ s1823 1) (GEQ s440 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 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-07 finished in 10768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1318 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:28] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-09 11:20:28] [INFO ] Implicit Places using invariants in 836 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:29] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-09 11:20:30] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:30] [INFO ] Invariants computation overflowed in 144 ms
[2023-03-09 11:20:31] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4825 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s3818 1) (LT s3896 1)), p0:(OR (LT s1072 1) (LT s1180 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4995 ms.
Product exploration explored 100000 steps with 50000 reset in 4715 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-08 finished in 15399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(p2)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1076 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:43] [INFO ] Invariants computation overflowed in 187 ms
[2023-03-09 11:20:44] [INFO ] Implicit Places using invariants in 1055 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:44] [INFO ] Invariants computation overflowed in 189 ms
[2023-03-09 11:20:45] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:46] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:20:46] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4722 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s3941 1), p2:(LT s2439 1), p0:(LT s476 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4759 ms.
Product exploration explored 100000 steps with 50000 reset in 4897 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 p0)
Knowledge based reduction with 23 factoid took 943 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-09 finished in 16114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1254 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:59] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-09 11:21:00] [INFO ] Implicit Places using invariants in 895 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:21:00] [INFO ] Invariants computation overflowed in 127 ms
[2023-03-09 11:21:02] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2580 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:21:02] [INFO ] Invariants computation overflowed in 121 ms
[2023-03-09 11:21:03] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4777 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s4937 1) (LT s5015 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3348 reset in 333 ms.
Product exploration explored 100000 steps with 3313 reset in 357 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39969 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39969 steps, saw 19995 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:21:09] [INFO ] Invariants computation overflowed in 122 ms
[2023-03-09 11:21:34] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 236 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 148 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 81 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 77 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 2704 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2704 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1287 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100596 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100596 steps, saw 50343 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:21:40] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 11:22:00] [INFO ] After 20043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 250 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 245 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:22:00] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-09 11:22:30] [INFO ] Implicit Places using invariants in 30142 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:22:30] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-09 11:23:01] [INFO ] Implicit Places using invariants and state equation in 30897 ms returned []
Implicit Place search using SMT with State Equation took 61044 ms to find 0 implicit places.
[2023-03-09 11:23:02] [INFO ] Redundant transitions in 212 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:23:02] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 11:23:05] [INFO ] Dead Transitions using invariants and state equation in 3352 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64868 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1298 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:23:07] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-09 11:23:08] [INFO ] Implicit Places using invariants in 960 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:23:08] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-09 11:23:09] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2595 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:23:09] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-09 11:23:10] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4827 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 48059 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48059 steps, saw 24039 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:23:16] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-09 11:23:41] [INFO ] After 25056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 392 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 153 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 118 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 112 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 3200 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3200 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100706 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100706 steps, saw 50398 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:23:47] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-09 11:24:06] [INFO ] After 19142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 417 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 409 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:24:07] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-09 11:24:37] [INFO ] Implicit Places using invariants in 30017 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:24:37] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-09 11:25:08] [INFO ] Performed 2348/2397 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:25:09] [INFO ] Implicit Places using invariants and state equation in 31793 ms returned []
Implicit Place search using SMT with State Equation took 61818 ms to find 0 implicit places.
[2023-03-09 11:25:09] [INFO ] Redundant transitions in 212 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-09 11:25:09] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-09 11:25:12] [INFO ] Dead Transitions using invariants and state equation in 3336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65794 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3341 reset in 390 ms.
Product exploration explored 100000 steps with 3333 reset in 395 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1197 place count 5300 transition count 5198
Deduced a syphon composed of 1398 places in 380 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1398 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1400 place count 5298 transition count 5196
Deduced a syphon composed of 1396 places in 272 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1402 place count 5298 transition count 5196
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 2298 places in 199 ms
Iterating global reduction 1 with 902 rules applied. Total rules applied 2304 place count 5298 transition count 5396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2305 place count 5297 transition count 5395
Deduced a syphon composed of 2297 places in 173 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2306 place count 5297 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2398 places in 174 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2407 place count 5297 transition count 6059
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2508 place count 5196 transition count 5857
Deduced a syphon composed of 2297 places in 164 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2609 place count 5196 transition count 5857
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -627
Deduced a syphon composed of 2396 places in 178 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2708 place count 5196 transition count 6484
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 2807 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 192 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2906 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 156 ms
Applied a total of 2906 rules in 6893 ms. Remains 5097 /5300 variables (removed 203) and now considering 6286/4998 (removed -1288) transitions.
[2023-03-09 11:25:22] [INFO ] Redundant transitions in 638 ms returned []
// Phase 1: matrix 6286 rows 5097 cols
[2023-03-09 11:25:22] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-09 11:25:23] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5097/5300 places, 6286/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8296 ms. Remains : 5097/5300 places, 6286/4998 transitions.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1245 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:25:24] [INFO ] Invariants computation overflowed in 121 ms
[2023-03-09 11:25:25] [INFO ] Implicit Places using invariants in 1093 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:25:25] [INFO ] Invariants computation overflowed in 185 ms
[2023-03-09 11:25:27] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2765 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:25:27] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-09 11:25:28] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5074 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-10 finished in 272053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1193 rules applied. Total rules applied 1193 place count 5299 transition count 3804
Reduce places removed 1193 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1195 rules applied. Total rules applied 2388 place count 4106 transition count 3802
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2390 place count 4104 transition count 3802
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2390 place count 4104 transition count 3602
Deduced a syphon composed of 200 places in 328 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 107 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 77 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 69 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4986 place count 2806 transition count 2701
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4988 place count 2806 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2805 transition count 2700
Applied a total of 4989 rules in 2452 ms. Remains 2805 /5300 variables (removed 2495) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:25:32] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 11:25:35] [INFO ] Implicit Places using invariants in 3066 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:25:35] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 11:25:40] [INFO ] Implicit Places using invariants and state equation in 4244 ms returned []
Implicit Place search using SMT with State Equation took 7333 ms to find 0 implicit places.
[2023-03-09 11:25:40] [INFO ] Redundant transitions in 136 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:25:40] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 11:25:42] [INFO ] Dead Transitions using invariants and state equation in 2636 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12575 ms. Remains : 2805/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s152 1), p2:(GEQ s101 1), p0:(OR (LT s2029 1) (LT s2087 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13854 reset in 335 ms.
Product exploration explored 100000 steps with 13820 reset in 367 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1388 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 794 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 56918 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56918 steps, saw 28474 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:25:48] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 11:26:13] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:26:38] [INFO ] After 24472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:26:38] [INFO ] State equation strengthened by 197 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 11:26:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:26:38] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 1158 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1158 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 82309 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82309 steps, saw 41173 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:26:42] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-09 11:27:07] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:27:32] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 302 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 465 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:27:33] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-09 11:28:03] [INFO ] Performed 1659/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:28:13] [INFO ] Implicit Places using invariants in 40327 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:28:13] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-09 11:28:44] [INFO ] Performed 1630/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:28:55] [INFO ] Implicit Places using invariants and state equation in 41866 ms returned []
Implicit Place search using SMT with State Equation took 82229 ms to find 0 implicit places.
[2023-03-09 11:28:55] [INFO ] Redundant transitions in 237 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:28:56] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-09 11:28:59] [INFO ] Dead Transitions using invariants and state equation in 3170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86119 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 337 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:29:00] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-09 11:29:03] [INFO ] Implicit Places using invariants in 3369 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:29:03] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 11:29:08] [INFO ] Implicit Places using invariants and state equation in 4634 ms returned []
Implicit Place search using SMT with State Equation took 8021 ms to find 0 implicit places.
[2023-03-09 11:29:08] [INFO ] Redundant transitions in 200 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:29:08] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-09 11:29:11] [INFO ] Dead Transitions using invariants and state equation in 3429 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11999 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1397 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 65821 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65821 steps, saw 32921 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:29:15] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-09 11:29:41] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:30:06] [INFO ] After 24411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:30:06] [INFO ] State equation strengthened by 197 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 11:30:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:30:06] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 68 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 1158 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1169 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1280 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 64200 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64200 steps, saw 32115 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:30:10] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-09 11:30:35] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:31:00] [INFO ] After 24395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:31:00] [INFO ] State equation strengthened by 397 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 11:31:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:31:00] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 390 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 361 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:31:01] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 11:31:32] [INFO ] Performed 1687/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:31:41] [INFO ] Implicit Places using invariants in 39680 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:31:41] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-09 11:32:12] [INFO ] Performed 1631/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:32:22] [INFO ] Implicit Places using invariants and state equation in 41482 ms returned []
Implicit Place search using SMT with State Equation took 81193 ms to find 0 implicit places.
[2023-03-09 11:32:23] [INFO ] Redundant transitions in 237 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-09 11:32:23] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-09 11:32:26] [INFO ] Dead Transitions using invariants and state equation in 3400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85228 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13870 reset in 337 ms.
Product exploration explored 100000 steps with 13842 reset in 343 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 201 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:32:28] [INFO ] Invariants computation overflowed in 89 ms
[2023-03-09 11:32:31] [INFO ] Implicit Places using invariants in 3402 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:32:31] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-09 11:32:36] [INFO ] Implicit Places using invariants and state equation in 4609 ms returned []
Implicit Place search using SMT with State Equation took 8013 ms to find 0 implicit places.
[2023-03-09 11:32:36] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-09 11:32:36] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 11:32:39] [INFO ] Dead Transitions using invariants and state equation in 3000 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11358 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-11 finished in 429609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1) U p2)&&F(p3))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2390 place count 4105 transition count 3801
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2392 place count 4103 transition count 3801
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3601
Deduced a syphon composed of 200 places in 352 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2792 place count 3903 transition count 3601
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 93 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 72 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 113 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4990 place count 2804 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4991 place count 2803 transition count 2698
Applied a total of 4991 rules in 2351 ms. Remains 2803 /5300 variables (removed 2497) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-09 11:32:42] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-09 11:32:46] [INFO ] Implicit Places using invariants in 4061 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-09 11:32:46] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-09 11:32:51] [INFO ] Implicit Places using invariants and state equation in 4799 ms returned []
Implicit Place search using SMT with State Equation took 8863 ms to find 0 implicit places.
[2023-03-09 11:32:51] [INFO ] Redundant transitions in 217 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-09 11:32:51] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:32:54] [INFO ] Dead Transitions using invariants and state equation in 3645 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15083 ms. Remains : 2803/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s1096 1) (GEQ s1103 1)) (GEQ s2308 1)), p2:(AND (GEQ s1096 1) (GEQ s1103 1)), p1:(GEQ s2308 1), p3:(GEQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-12 finished in 15586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1336 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:32:57] [INFO ] Invariants computation overflowed in 189 ms
[2023-03-09 11:32:57] [INFO ] Implicit Places using invariants in 1070 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:32:58] [INFO ] Invariants computation overflowed in 188 ms
[2023-03-09 11:32:59] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 3143 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:33:00] [INFO ] Invariants computation overflowed in 122 ms
[2023-03-09 11:33:00] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5411 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3732 1) (GEQ s860 1) (GEQ s949 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-15 finished in 6136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLFireability-10
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 393 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 92 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 80 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 75 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4998 place count 2800 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4999 place count 2799 transition count 2695
Applied a total of 4999 rules in 2201 ms. Remains 2799 /5300 variables (removed 2501) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:33:04] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-09 11:33:08] [INFO ] Implicit Places using invariants in 3616 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:33:08] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-09 11:33:09] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 4715 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:33:09] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 11:33:12] [INFO ] Dead Transitions using invariants and state equation in 3485 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2799/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10406 ms. Remains : 2799/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s2606 1) (LT s2646 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13933 reset in 337 ms.
Product exploration explored 100000 steps with 13798 reset in 367 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1391 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76223 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76223 steps, saw 38118 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:33:16] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 11:33:30] [INFO ] After 13445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 65 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 1064 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1222 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100386 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100386 steps, saw 50237 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:33:34] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:33:59] [INFO ] After 25047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 258 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 418 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:34:00] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-09 11:34:27] [INFO ] Implicit Places using invariants in 27611 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:34:28] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-09 11:34:29] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 28742 ms to find 0 implicit places.
[2023-03-09 11:34:29] [INFO ] Redundant transitions in 124 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:34:29] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:34:32] [INFO ] Dead Transitions using invariants and state equation in 3111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32416 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2400 transition count 2097
Deduced a syphon composed of 199 places in 191 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2201 transition count 2097
Applied a total of 398 rules in 598 ms. Remains 2201 /2400 variables (removed 199) and now considering 2097/2296 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2201 cols
[2023-03-09 11:34:33] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 11:34:49] [INFO ] After 16556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 304 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:34:50] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-09 11:34:54] [INFO ] Implicit Places using invariants in 3254 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:34:54] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 11:34:58] [INFO ] Implicit Places using invariants and state equation in 4005 ms returned []
Implicit Place search using SMT with State Equation took 7263 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:34:58] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 3679 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11256 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1365 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 799 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 74160 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74160 steps, saw 37093 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:35:05] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-09 11:35:19] [INFO ] After 13550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 106 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 1250 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1250 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1271 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98786 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98786 steps, saw 49434 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:35:23] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-09 11:35:48] [INFO ] After 25049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 490 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 414 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:35:49] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-09 11:36:12] [INFO ] Implicit Places using invariants in 23035 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:36:12] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:36:40] [INFO ] Implicit Places using invariants and state equation in 27615 ms returned []
Implicit Place search using SMT with State Equation took 50661 ms to find 0 implicit places.
[2023-03-09 11:36:40] [INFO ] Redundant transitions in 124 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-09 11:36:40] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 11:36:42] [INFO ] Dead Transitions using invariants and state equation in 2273 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53497 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13838 reset in 366 ms.
Product exploration explored 100000 steps with 13861 reset in 329 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 276 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2023-03-09 11:36:44] [INFO ] Redundant transitions in 218 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:36:44] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-09 11:36:47] [INFO ] Dead Transitions using invariants and state equation in 2722 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3249 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 214 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:36:47] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 11:36:50] [INFO ] Implicit Places using invariants in 3085 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:36:51] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-09 11:36:55] [INFO ] Implicit Places using invariants and state equation in 4173 ms returned []
Implicit Place search using SMT with State Equation took 7270 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:36:55] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 11:36:57] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10158 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-10 finished in 236231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
[2023-03-09 11:36:58] [INFO ] Flatten gal took : 267 ms
[2023-03-09 11:36:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-09 11:36:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5300 places, 4998 transitions and 14090 arcs took 70 ms.
Total runtime 1717948 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
BK_STOP 1678361951109
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 8 (type EXCL) for 7 DoubleExponent-PT-100-LTLFireability-06
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type FNDP) for 0 DoubleExponent-PT-100-LTLFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type EQUN) for 0 DoubleExponent-PT-100-LTLFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 0 DoubleExponent-PT-100-LTLFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 3 0 2 0 0 0
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 1/718 1/32 DoubleExponent-PT-100-LTLFireability-06 16319 m, 3263 m/sec, 18144 t fired, .
17 EF FNDP 1/3590 0/5 DoubleExponent-PT-100-LTLFireability-04 490 t fired, 48 attempts, .
18 EF STEQ 1/3590 0/5 DoubleExponent-PT-100-LTLFireability-04 sara not yet started (preprocessing).
20 EF SRCH 1/3590 1/5 DoubleExponent-PT-100-LTLFireability-04 --
Time elapsed: 11 secs. Pages in use: 2
# running tasks: 4 of 4 Visible: 4
lola: FINISHED task # 20 (type SRCH) for DoubleExponent-PT-100-LTLFireability-04
lola: result : unknown
lola: markings : 10
lola: fired transitions : 9
lola: time used : 1.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/373/LTLFireability-18.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 2 2 0 3 0 0 0
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 6/718 5/32 DoubleExponent-PT-100-LTLFireability-06 161406 m, 29017 m/sec, 189273 t fired, .
17 EF FNDP 6/3590 0/5 DoubleExponent-PT-100-LTLFireability-04 60562 t fired, 6207 attempts, .
18 EF STEQ 6/3590 0/5 DoubleExponent-PT-100-LTLFireability-04 sara is running.
Time elapsed: 16 secs. Pages in use: 5
# running tasks: 3 of 4 Visible: 4
lola: FINISHED task # 18 (type EQUN) for DoubleExponent-PT-100-LTLFireability-04
lola: result : false
lola: CANCELED task # 17 (type FNDP) for DoubleExponent-PT-100-LTLFireability-04 (obsolete)
lola: FINISHED task # 17 (type FNDP) for DoubleExponent-PT-100-LTLFireability-04
lola: result : unknown
lola: fired transitions : 112316
lola: tried executions : 11499
lola: time used : 9.000000
lola: memory pages used : 0
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 11/897 9/32 DoubleExponent-PT-100-LTLFireability-06 359784 m, 39675 m/sec, 423350 t fired, .
Time elapsed: 21 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 16/897 14/32 DoubleExponent-PT-100-LTLFireability-06 564201 m, 40883 m/sec, 664570 t fired, .
Time elapsed: 26 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 21/897 18/32 DoubleExponent-PT-100-LTLFireability-06 769126 m, 40985 m/sec, 906450 t fired, .
Time elapsed: 31 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 26/897 23/32 DoubleExponent-PT-100-LTLFireability-06 972170 m, 40608 m/sec, 1146073 t fired, .
Time elapsed: 36 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 31/897 27/32 DoubleExponent-PT-100-LTLFireability-06 1172623 m, 40090 m/sec, 1382653 t fired, .
Time elapsed: 41 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 36/897 31/32 DoubleExponent-PT-100-LTLFireability-06 1369942 m, 39463 m/sec, 1615576 t fired, .
Time elapsed: 46 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 8 (type EXCL) for DoubleExponent-PT-100-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 11 (type EXCL) for 10 DoubleExponent-PT-100-LTLFireability-10
lola: time limit : 1183 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1183 8/32 DoubleExponent-PT-100-LTLFireability-10 128864 m, 25772 m/sec, 142539 t fired, .
Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1183 17/32 DoubleExponent-PT-100-LTLFireability-10 269232 m, 28073 m/sec, 297824 t fired, .
Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/1183 25/32 DoubleExponent-PT-100-LTLFireability-10 409408 m, 28035 m/sec, 452901 t fired, .
Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 11 (type EXCL) for DoubleExponent-PT-100-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 1 0 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 5 (type EXCL) for 0 DoubleExponent-PT-100-LTLFireability-04
lola: time limit : 1764 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 1 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1764 9/32 DoubleExponent-PT-100-LTLFireability-04 131664 m, 26332 m/sec, 145629 t fired, .
Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 1 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1764 17/32 DoubleExponent-PT-100-LTLFireability-04 274440 m, 28555 m/sec, 303582 t fired, .
Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 1 0 5 0 0 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1764 26/32 DoubleExponent-PT-100-LTLFireability-04 416055 m, 28323 m/sec, 460258 t fired, .
Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 5 (type EXCL) for DoubleExponent-PT-100-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 14 (type EXCL) for 13 DoubleExponent-PT-100-LTLFireability-11
lola: time limit : 3509 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/3509 5/32 DoubleExponent-PT-100-LTLFireability-11 194690 m, 38938 m/sec, 228535 t fired, .
Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/3509 10/32 DoubleExponent-PT-100-LTLFireability-11 393872 m, 39836 m/sec, 463570 t fired, .
Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/3509 14/32 DoubleExponent-PT-100-LTLFireability-11 593036 m, 39832 m/sec, 698602 t fired, .
Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/3509 19/32 DoubleExponent-PT-100-LTLFireability-11 795250 m, 40442 m/sec, 937256 t fired, .
Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 25/3509 23/32 DoubleExponent-PT-100-LTLFireability-11 992226 m, 39395 m/sec, 1169744 t fired, .
Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 30/3509 27/32 DoubleExponent-PT-100-LTLFireability-11 1191567 m, 39868 m/sec, 1405012 t fired, .
Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 35/3509 32/32 DoubleExponent-PT-100-LTLFireability-11 1388795 m, 39445 m/sec, 1637820 t fired, .
Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for DoubleExponent-PT-100-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLFireability-04: CONJ 0 0 0 0 5 0 1 1
DoubleExponent-PT-100-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLFireability-04: CONJ unknown CONJ
DoubleExponent-PT-100-LTLFireability-06: LTL unknown AGGR
DoubleExponent-PT-100-LTLFireability-10: LTL unknown AGGR
DoubleExponent-PT-100-LTLFireability-11: LTL unknown AGGR
Time elapsed: 131 secs. Pages in use: 32
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="DoubleExponent-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DoubleExponent-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414500492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;