About the Execution of 2023-gold for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16202.735 | 3600000.00 | 9473272.00 | 53827.00 | FTTFF?FFTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521400073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANInsertWithFailure-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400073
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.6M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716227277180
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 17:47:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 17:47:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 17:47:59] [INFO ] Load time of PNML (sax parser for PT used): 349 ms
[2024-05-20 17:47:59] [INFO ] Transformed 2164 places.
[2024-05-20 17:47:59] [INFO ] Transformed 5580 transitions.
[2024-05-20 17:47:59] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 282 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-20 17:47:59] [INFO ] Computed 32 invariants in 242 ms
[2024-05-20 17:48:00] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-20 17:48:00] [INFO ] Invariant cache hit.
[2024-05-20 17:48:01] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:48:02] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2916 ms to find 0 implicit places.
[2024-05-20 17:48:02] [INFO ] Invariant cache hit.
[2024-05-20 17:48:04] [INFO ] Dead Transitions using invariants and state equation in 2446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5648 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 42 out of 2163 places after structural reductions.
[2024-05-20 17:48:05] [INFO ] Flatten gal took : 254 ms
[2024-05-20 17:48:05] [INFO ] Flatten gal took : 154 ms
[2024-05-20 17:48:05] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 37 out of 2163 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 27) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 17:48:06] [INFO ] Invariant cache hit.
[2024-05-20 17:48:07] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2024-05-20 17:48:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-20 17:48:10] [INFO ] After 2506ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2024-05-20 17:48:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:48:11] [INFO ] After 1279ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 17:48:11] [INFO ] After 4670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 17:48:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2024-05-20 17:48:11] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-20 17:48:14] [INFO ] After 2270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 17:48:18] [INFO ] After 4585ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 17:48:20] [INFO ] After 6417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1083 ms.
[2024-05-20 17:48:21] [INFO ] After 10487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 4 properties in 51 ms.
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 4 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 809 transitions
Redundant transition composition rules discarded 809 transitions
Iterating global reduction 2 with 809 rules applied. Total rules applied 2961 place count 1087 transition count 3695
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2963 place count 1087 transition count 3693
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2965 place count 1085 transition count 3693
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3895 place count 1085 transition count 3693
Applied a total of 3895 rules in 826 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3693/5580 (removed 1887) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 1085/2163 places, 3693/5580 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3693 rows 1085 cols
[2024-05-20 17:48:22] [INFO ] Computed 32 invariants in 50 ms
[2024-05-20 17:48:23] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-20 17:48:23] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 17:48:24] [INFO ] After 844ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-20 17:48:24] [INFO ] State equation strengthened by 3594 read => feed constraints.
[2024-05-20 17:48:24] [INFO ] After 455ms SMT Verify possible using 3594 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:48:24] [INFO ] After 1579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:48:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 17:48:24] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:48:25] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 17:48:26] [INFO ] After 571ms SMT Verify possible using 3594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 17:48:26] [INFO ] After 885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 216 ms.
[2024-05-20 17:48:26] [INFO ] After 2107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 4 ms.
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3693/3693 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1083 transition count 3691
Applied a total of 4 rules in 121 ms. Remains 1083 /1085 variables (removed 2) and now considering 3691/3693 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1083/1085 places, 3691/3693 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 200603 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200603 steps, saw 32826 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 1083 cols
[2024-05-20 17:48:29] [INFO ] Computed 32 invariants in 48 ms
[2024-05-20 17:48:30] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-20 17:48:30] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-20 17:48:30] [INFO ] After 735ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 17:48:30] [INFO ] State equation strengthened by 3598 read => feed constraints.
[2024-05-20 17:48:31] [INFO ] After 356ms SMT Verify possible using 3598 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:48:31] [INFO ] After 1288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:48:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 17:48:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-20 17:48:32] [INFO ] After 734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:48:32] [INFO ] After 328ms SMT Verify possible using 3598 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:48:32] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-05-20 17:48:32] [INFO ] After 1486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3691/3691 transitions.
Applied a total of 0 rules in 84 ms. Remains 1083 /1083 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1083/1083 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3691/3691 transitions.
Applied a total of 0 rules in 76 ms. Remains 1083 /1083 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-20 17:48:32] [INFO ] Invariant cache hit.
[2024-05-20 17:48:33] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-20 17:48:33] [INFO ] Invariant cache hit.
[2024-05-20 17:48:34] [INFO ] State equation strengthened by 3598 read => feed constraints.
[2024-05-20 17:48:55] [INFO ] Implicit Places using invariants and state equation in 21968 ms returned []
Implicit Place search using SMT with State Equation took 22943 ms to find 0 implicit places.
[2024-05-20 17:48:56] [INFO ] Redundant transitions in 254 ms returned []
[2024-05-20 17:48:56] [INFO ] Invariant cache hit.
[2024-05-20 17:48:57] [INFO ] Dead Transitions using invariants and state equation in 1232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24523 ms. Remains : 1083/1083 places, 3691/3691 transitions.
Graph (trivial) has 3504 edges and 1083 vertex of which 958 / 1083 are part of one of the 2 SCC in 5 ms
Free SCC test removed 956 places
Drop transitions removed 2637 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3559 transitions.
Graph (complete) has 314 edges and 127 vertex of which 40 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.1 ms
Discarding 87 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 40 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 39 transition count 44
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 90 place count 12 transition count 17
Iterating global reduction 2 with 27 rules applied. Total rules applied 117 place count 12 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 12 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 11 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 9 transition count 11
Applied a total of 125 rules in 20 ms. Remains 9 /1083 variables (removed 1074) and now considering 11/3691 (removed 3680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 9 cols
[2024-05-20 17:48:57] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 17:48:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 17:48:57] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 17:48:57] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 17:48:57] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
FORMULA CANInsertWithFailure-PT-030-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 122 stabilizing places and 210 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U !p1)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 84 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-20 17:48:57] [INFO ] Computed 32 invariants in 122 ms
[2024-05-20 17:48:58] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-20 17:48:58] [INFO ] Invariant cache hit.
[2024-05-20 17:48:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:49:00] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
[2024-05-20 17:49:00] [INFO ] Invariant cache hit.
[2024-05-20 17:49:02] [INFO ] Dead Transitions using invariants and state equation in 2213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5308 ms. Remains : 2163/2163 places, 5580/5580 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 239 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s273 1) (GEQ s691 1)), p0:(GEQ s576 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1978 ms.
Product exploration explored 100000 steps with 50000 reset in 1823 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-01 finished in 9459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X((X(p2)||p1))||G(p3)))||p0)))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 70 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:49:07] [INFO ] Invariant cache hit.
[2024-05-20 17:49:08] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-05-20 17:49:08] [INFO ] Invariant cache hit.
[2024-05-20 17:49:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:49:10] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
[2024-05-20 17:49:10] [INFO ] Invariant cache hit.
[2024-05-20 17:49:12] [INFO ] Dead Transitions using invariants and state equation in 2166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5099 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 339 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p3), acceptance={} source=8 dest: 0}, { cond=p3, acceptance={} source=8 dest: 8}]], initial=3, aps=[p1:(OR (LT s264 1) (LT s301 1)), p2:(GEQ s1632 1), p0:(OR (LT s264 1) (LT s301 1)), p3:(LT s864 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1781 ms.
Product exploration explored 100000 steps with 50000 reset in 1766 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X p0), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 9 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-02 finished in 9046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (G(p1)&&(!p1||F(!p0))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 86 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:49:16] [INFO ] Invariant cache hit.
[2024-05-20 17:49:17] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-05-20 17:49:17] [INFO ] Invariant cache hit.
[2024-05-20 17:49:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:49:19] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
[2024-05-20 17:49:19] [INFO ] Invariant cache hit.
[2024-05-20 17:49:21] [INFO ] Dead Transitions using invariants and state equation in 2203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5104 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) p0), true, (AND (NOT p1) (NOT p0)), (NOT p1), p0, true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s49 1) (GEQ s1531 1)), p0:(AND (GEQ s278 1) (GEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-04 finished in 5355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 70 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:49:21] [INFO ] Invariant cache hit.
[2024-05-20 17:49:22] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-20 17:49:22] [INFO ] Invariant cache hit.
[2024-05-20 17:49:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:49:24] [INFO ] Implicit Places using invariants and state equation in 2080 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
[2024-05-20 17:49:24] [INFO ] Invariant cache hit.
[2024-05-20 17:49:26] [INFO ] Dead Transitions using invariants and state equation in 2160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5101 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s135 1) (OR (LT s133 1) (LT s1717 1))), p0:(OR (LT s672 1) (LT s49 1) (LT s427 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 138 reset in 546 ms.
Product exploration explored 100000 steps with 140 reset in 635 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 17:49:28] [INFO ] Invariant cache hit.
[2024-05-20 17:49:28] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2024-05-20 17:49:28] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 17:49:30] [INFO ] After 1613ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:49:30] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:49:30] [INFO ] After 517ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:49:30] [INFO ] After 2508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:49:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-20 17:49:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 17:49:33] [INFO ] After 1824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:49:36] [INFO ] After 3560ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:49:37] [INFO ] After 4261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 383 ms.
[2024-05-20 17:49:37] [INFO ] After 6859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 2964 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 4 with 930 rules applied. Total rules applied 3897 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 3927 place count 1085 transition count 3691
Applied a total of 3927 rules in 640 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 640 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 175135 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175135 steps, saw 31719 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-20 17:49:41] [INFO ] Computed 32 invariants in 45 ms
[2024-05-20 17:49:41] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 17:49:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 17:49:42] [INFO ] After 864ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:49:42] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:49:43] [INFO ] After 515ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:49:43] [INFO ] After 1600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:49:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2024-05-20 17:49:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:49:44] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:49:45] [INFO ] After 741ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:49:45] [INFO ] After 1196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 320 ms.
[2024-05-20 17:49:45] [INFO ] After 2566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 66 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 60 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-20 17:49:45] [INFO ] Invariant cache hit.
[2024-05-20 17:49:46] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-20 17:49:46] [INFO ] Invariant cache hit.
[2024-05-20 17:49:47] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:50:07] [INFO ] Implicit Places using invariants and state equation in 20498 ms returned []
Implicit Place search using SMT with State Equation took 21368 ms to find 0 implicit places.
[2024-05-20 17:50:07] [INFO ] Redundant transitions in 175 ms returned []
[2024-05-20 17:50:07] [INFO ] Invariant cache hit.
[2024-05-20 17:50:08] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22825 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 12 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-20 17:50:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 17:50:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-20 17:50:08] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:50:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 17:50:08] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:50:08] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 17:50:08] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Applied a total of 2961 rules in 489 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-20 17:50:09] [INFO ] Computed 32 invariants in 60 ms
[2024-05-20 17:50:10] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-20 17:50:10] [INFO ] Invariant cache hit.
[2024-05-20 17:50:11] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:50:15] [INFO ] Implicit Places using invariants and state equation in 5382 ms returned []
Implicit Place search using SMT with State Equation took 5994 ms to find 0 implicit places.
[2024-05-20 17:50:15] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-20 17:50:15] [INFO ] Invariant cache hit.
[2024-05-20 17:50:17] [INFO ] Dead Transitions using invariants and state equation in 1232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1088/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7831 ms. Remains : 1088/2163 places, 3694/5580 transitions.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 17:50:17] [INFO ] Invariant cache hit.
[2024-05-20 17:50:17] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 17:50:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:50:18] [INFO ] After 704ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:50:18] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:50:18] [INFO ] After 308ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:50:18] [INFO ] After 1210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:50:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 17:50:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:50:19] [INFO ] After 903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:50:20] [INFO ] After 757ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:50:20] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 271 ms.
[2024-05-20 17:50:21] [INFO ] After 2603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 253 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 1085/1088 places, 3691/3694 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 175181 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175181 steps, saw 31725 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-20 17:50:24] [INFO ] Computed 32 invariants in 39 ms
[2024-05-20 17:50:24] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2024-05-20 17:50:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-20 17:50:25] [INFO ] After 964ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:50:25] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:50:26] [INFO ] After 517ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:50:26] [INFO ] After 1716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:50:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-20 17:50:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 17:50:27] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:50:28] [INFO ] After 699ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:50:28] [INFO ] After 1202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 312 ms.
[2024-05-20 17:50:28] [INFO ] After 2563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 60 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 60 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-20 17:50:29] [INFO ] Invariant cache hit.
[2024-05-20 17:50:29] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-05-20 17:50:29] [INFO ] Invariant cache hit.
[2024-05-20 17:50:30] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:50:47] [INFO ] Implicit Places using invariants and state equation in 17077 ms returned []
Implicit Place search using SMT with State Equation took 17915 ms to find 0 implicit places.
[2024-05-20 17:50:47] [INFO ] Redundant transitions in 114 ms returned []
[2024-05-20 17:50:47] [INFO ] Invariant cache hit.
[2024-05-20 17:50:48] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19353 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 0 ms
Free SCC test removed 924 places
Drop transitions removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 8 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-20 17:50:48] [INFO ] Computed 2 invariants in 4 ms
[2024-05-20 17:50:48] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 17:50:48] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:50:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 17:50:48] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:50:48] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 17:50:48] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 638 reset in 680 ms.
Product exploration explored 100000 steps with 643 reset in 705 ms.
Built C files in :
/tmp/ltsmin14047069715293335027
[2024-05-20 17:50:50] [INFO ] Too many transitions (3694) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:50:50] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14047069715293335027
Running compilation step : cd /tmp/ltsmin14047069715293335027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14047069715293335027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14047069715293335027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 55 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-20 17:50:53] [INFO ] Computed 32 invariants in 42 ms
[2024-05-20 17:50:53] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-20 17:50:53] [INFO ] Invariant cache hit.
[2024-05-20 17:50:54] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:50:59] [INFO ] Implicit Places using invariants and state equation in 5954 ms returned []
Implicit Place search using SMT with State Equation took 6497 ms to find 0 implicit places.
[2024-05-20 17:51:00] [INFO ] Redundant transitions in 110 ms returned []
[2024-05-20 17:51:00] [INFO ] Invariant cache hit.
[2024-05-20 17:51:01] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7974 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Built C files in :
/tmp/ltsmin9471508912603226506
[2024-05-20 17:51:01] [INFO ] Too many transitions (3694) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:51:01] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9471508912603226506
Running compilation step : cd /tmp/ltsmin9471508912603226506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9471508912603226506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9471508912603226506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 17:51:04] [INFO ] Flatten gal took : 92 ms
[2024-05-20 17:51:04] [INFO ] Flatten gal took : 94 ms
[2024-05-20 17:51:04] [INFO ] Time to serialize gal into /tmp/LTL4176899848138516342.gal : 20 ms
[2024-05-20 17:51:04] [INFO ] Time to serialize properties into /tmp/LTL9379684649786476239.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4176899848138516342.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1440633369121871326.hoa' '-atoms' '/tmp/LTL9379684649786476239.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9379684649786476239.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1440633369121871326.hoa
Detected timeout of ITS tools.
[2024-05-20 17:51:20] [INFO ] Flatten gal took : 72 ms
[2024-05-20 17:51:20] [INFO ] Flatten gal took : 71 ms
[2024-05-20 17:51:20] [INFO ] Time to serialize gal into /tmp/LTL8053661336698328413.gal : 15 ms
[2024-05-20 17:51:20] [INFO ] Time to serialize properties into /tmp/LTL11577790015203555605.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8053661336698328413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11577790015203555605.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4GiveAnswer9<1)||(Node3IsInserted<1))")||(("(Node0requestsent3<1)")||(G("((Node9ID2<1)&&((Node9IsInserted<1)||(Node22re...178
Formula 0 simplified : XF(!"((Node4GiveAnswer9<1)||(Node3IsInserted<1))" & !"(Node0requestsent3<1)" & F!"((Node9ID2<1)&&((Node9IsInserted<1)||(Node22reques...168
Detected timeout of ITS tools.
[2024-05-20 17:51:35] [INFO ] Flatten gal took : 65 ms
[2024-05-20 17:51:35] [INFO ] Applying decomposition
[2024-05-20 17:51:35] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5967581399077859573.txt' '-o' '/tmp/graph5967581399077859573.bin' '-w' '/tmp/graph5967581399077859573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5967581399077859573.bin' '-l' '-1' '-v' '-w' '/tmp/graph5967581399077859573.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:51:35] [INFO ] Decomposing Gal with order
[2024-05-20 17:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:51:36] [INFO ] Removed a total of 2712 redundant transitions.
[2024-05-20 17:51:36] [INFO ] Flatten gal took : 702 ms
[2024-05-20 17:51:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1741 labels/synchronizations in 211 ms.
[2024-05-20 17:51:36] [INFO ] Time to serialize gal into /tmp/LTL14349470883251230530.gal : 53 ms
[2024-05-20 17:51:36] [INFO ] Time to serialize properties into /tmp/LTL13598481124065086549.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14349470883251230530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13598481124065086549.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u10.Node4GiveAnswer9<1)||(u4.Node3IsInserted<1))")||(("(u1.Node0requestsent3<1)")||(G("((i0.u11.Node9ID2<1)&&((u10.Node9IsI...203
Formula 0 simplified : XF(!"((u10.Node4GiveAnswer9<1)||(u4.Node3IsInserted<1))" & !"(u1.Node0requestsent3<1)" & F!"((i0.u11.Node9ID2<1)&&((u10.Node9IsInser...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12288164132948591614
[2024-05-20 17:51:51] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12288164132948591614
Running compilation step : cd /tmp/ltsmin12288164132948591614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12288164132948591614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12288164132948591614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 153416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-20 17:51:55] [INFO ] Computed 32 invariants in 144 ms
[2024-05-20 17:51:55] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2024-05-20 17:51:55] [INFO ] Invariant cache hit.
[2024-05-20 17:51:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:51:58] [INFO ] Implicit Places using invariants and state equation in 2095 ms returned []
Implicit Place search using SMT with State Equation took 3098 ms to find 0 implicit places.
[2024-05-20 17:51:58] [INFO ] Invariant cache hit.
[2024-05-20 17:52:00] [INFO ] Dead Transitions using invariants and state equation in 2271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5433 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1738 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-06 finished in 5539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 66 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:52:00] [INFO ] Invariant cache hit.
[2024-05-20 17:52:01] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-20 17:52:01] [INFO ] Invariant cache hit.
[2024-05-20 17:52:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:52:03] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
[2024-05-20 17:52:03] [INFO ] Invariant cache hit.
[2024-05-20 17:52:05] [INFO ] Dead Transitions using invariants and state equation in 2233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5336 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s385 1) (GEQ s2101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 590 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-09 finished in 5428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||(p1&&F(p2))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 64 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:52:05] [INFO ] Invariant cache hit.
[2024-05-20 17:52:06] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-05-20 17:52:06] [INFO ] Invariant cache hit.
[2024-05-20 17:52:07] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:52:08] [INFO ] Implicit Places using invariants and state equation in 2148 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2024-05-20 17:52:08] [INFO ] Invariant cache hit.
[2024-05-20 17:52:11] [INFO ] Dead Transitions using invariants and state equation in 2270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5310 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p1:(GEQ s695 1), p2:(OR (LT s68 1) (LT s399 1)), p0:(GEQ s1502 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 651 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-10 finished in 5522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F((p1 U (G(p1)||(p1&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2))))))))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 62 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:52:11] [INFO ] Invariant cache hit.
[2024-05-20 17:52:12] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-20 17:52:12] [INFO ] Invariant cache hit.
[2024-05-20 17:52:13] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:52:14] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 3025 ms to find 0 implicit places.
[2024-05-20 17:52:14] [INFO ] Invariant cache hit.
[2024-05-20 17:52:16] [INFO ] Dead Transitions using invariants and state equation in 2288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5378 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=(AND p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={1} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={1} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s416 1), p0:(GEQ s516 1), p2:(AND (GEQ s273 1) (GEQ s1737 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1090 steps with 4 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-11 finished in 5662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:52:17] [INFO ] Invariant cache hit.
[2024-05-20 17:52:17] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-20 17:52:17] [INFO ] Invariant cache hit.
[2024-05-20 17:52:18] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:52:20] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 3019 ms to find 0 implicit places.
[2024-05-20 17:52:20] [INFO ] Invariant cache hit.
[2024-05-20 17:52:22] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5369 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s77 1) (GEQ s1187 1)), p0:(GEQ s244 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-12 finished in 5478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 62 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-20 17:52:22] [INFO ] Invariant cache hit.
[2024-05-20 17:52:23] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-20 17:52:23] [INFO ] Invariant cache hit.
[2024-05-20 17:52:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:52:25] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
[2024-05-20 17:52:25] [INFO ] Invariant cache hit.
[2024-05-20 17:52:27] [INFO ] Dead Transitions using invariants and state equation in 2229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5211 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LT s1286 1), p0:(AND (GEQ s40 1) (GEQ s259 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 643 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-13 finished in 5478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(!(F(p0) U !p1)))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Applied a total of 2967 rules in 316 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-20 17:52:28] [INFO ] Computed 32 invariants in 48 ms
[2024-05-20 17:52:28] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-20 17:52:28] [INFO ] Invariant cache hit.
[2024-05-20 17:52:29] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-20 17:52:34] [INFO ] Implicit Places using invariants and state equation in 5936 ms returned []
Implicit Place search using SMT with State Equation took 6475 ms to find 0 implicit places.
[2024-05-20 17:52:34] [INFO ] Redundant transitions in 106 ms returned []
[2024-05-20 17:52:34] [INFO ] Invariant cache hit.
[2024-05-20 17:52:36] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8102 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s361 1), p1:(AND (GEQ s173 1) (GEQ s902 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 165 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-14 finished in 8217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(!p0)))||G(p1)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 63 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-20 17:52:36] [INFO ] Computed 32 invariants in 118 ms
[2024-05-20 17:52:37] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-20 17:52:37] [INFO ] Invariant cache hit.
[2024-05-20 17:52:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 17:52:39] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
[2024-05-20 17:52:39] [INFO ] Invariant cache hit.
[2024-05-20 17:52:41] [INFO ] Dead Transitions using invariants and state equation in 2195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5154 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 219 ms :[p0, (NOT p1), (AND p0 (NOT p1)), true, true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(LT s1169 1), p1:(AND (GEQ s77 1) (GEQ s1593 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 747 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-15 finished in 5403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-030-LTLFireability-05
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 3 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Applied a total of 2961 rules in 305 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-20 17:52:42] [INFO ] Computed 32 invariants in 48 ms
[2024-05-20 17:52:42] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-20 17:52:42] [INFO ] Invariant cache hit.
[2024-05-20 17:52:43] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:52:48] [INFO ] Implicit Places using invariants and state equation in 5574 ms returned []
Implicit Place search using SMT with State Equation took 6115 ms to find 0 implicit places.
[2024-05-20 17:52:48] [INFO ] Invariant cache hit.
[2024-05-20 17:52:49] [INFO ] Dead Transitions using invariants and state equation in 1225 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1088/2163 places, 3694/5580 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7646 ms. Remains : 1088/2163 places, 3694/5580 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s62 1) (OR (LT s60 1) (LT s857 1))), p0:(OR (LT s316 1) (LT s23 1) (LT s189 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 636 reset in 711 ms.
Product exploration explored 100000 steps with 638 reset in 735 ms.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 17:52:51] [INFO ] Invariant cache hit.
[2024-05-20 17:52:51] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 17:52:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:52:52] [INFO ] After 719ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:52:52] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:52:52] [INFO ] After 315ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:52:52] [INFO ] After 1272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:52:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2024-05-20 17:52:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-20 17:52:53] [INFO ] After 924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:52:54] [INFO ] After 765ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:52:55] [INFO ] After 1220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 288 ms.
[2024-05-20 17:52:55] [INFO ] After 2640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 228 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 1085/1088 places, 3691/3694 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 149555 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149555 steps, saw 28515 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-20 17:52:58] [INFO ] Computed 32 invariants in 43 ms
[2024-05-20 17:52:59] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-20 17:52:59] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-20 17:53:00] [INFO ] After 876ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:53:00] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:53:00] [INFO ] After 535ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:53:00] [INFO ] After 1622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:53:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 17:53:00] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-20 17:53:01] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:53:02] [INFO ] After 795ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:53:02] [INFO ] After 1247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 333 ms.
[2024-05-20 17:53:03] [INFO ] After 2672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 60 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 60 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-20 17:53:03] [INFO ] Invariant cache hit.
[2024-05-20 17:53:04] [INFO ] Implicit Places using invariants in 869 ms returned []
[2024-05-20 17:53:04] [INFO ] Invariant cache hit.
[2024-05-20 17:53:04] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:53:22] [INFO ] Implicit Places using invariants and state equation in 18068 ms returned []
Implicit Place search using SMT with State Equation took 18939 ms to find 0 implicit places.
[2024-05-20 17:53:22] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-20 17:53:22] [INFO ] Invariant cache hit.
[2024-05-20 17:53:23] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20330 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 8 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-20 17:53:23] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 17:53:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-20 17:53:23] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:53:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 17:53:23] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:53:23] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 17:53:23] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 57 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-20 17:53:24] [INFO ] Computed 32 invariants in 48 ms
[2024-05-20 17:53:24] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-20 17:53:24] [INFO ] Invariant cache hit.
[2024-05-20 17:53:25] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:53:30] [INFO ] Implicit Places using invariants and state equation in 5511 ms returned []
Implicit Place search using SMT with State Equation took 6045 ms to find 0 implicit places.
[2024-05-20 17:53:30] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-20 17:53:30] [INFO ] Invariant cache hit.
[2024-05-20 17:53:31] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7449 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 17:53:32] [INFO ] Invariant cache hit.
[2024-05-20 17:53:32] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2024-05-20 17:53:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:53:32] [INFO ] After 692ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:53:32] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:53:33] [INFO ] After 308ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:53:33] [INFO ] After 1225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:53:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-20 17:53:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:53:34] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:53:35] [INFO ] After 740ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:53:35] [INFO ] After 1178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 266 ms.
[2024-05-20 17:53:35] [INFO ] After 2556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 223 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 1085/1088 places, 3691/3694 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 156885 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156885 steps, saw 29394 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-20 17:53:39] [INFO ] Computed 32 invariants in 43 ms
[2024-05-20 17:53:39] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 17:53:39] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:53:40] [INFO ] After 864ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 17:53:40] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:53:41] [INFO ] After 513ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:53:41] [INFO ] After 1585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:53:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 17:53:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:53:42] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:53:42] [INFO ] After 708ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:53:43] [INFO ] After 1185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 318 ms.
[2024-05-20 17:53:43] [INFO ] After 2591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 58 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 58 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-20 17:53:43] [INFO ] Invariant cache hit.
[2024-05-20 17:53:44] [INFO ] Implicit Places using invariants in 840 ms returned []
[2024-05-20 17:53:44] [INFO ] Invariant cache hit.
[2024-05-20 17:53:45] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-20 17:54:02] [INFO ] Implicit Places using invariants and state equation in 18062 ms returned []
Implicit Place search using SMT with State Equation took 18904 ms to find 0 implicit places.
[2024-05-20 17:54:02] [INFO ] Redundant transitions in 116 ms returned []
[2024-05-20 17:54:02] [INFO ] Invariant cache hit.
[2024-05-20 17:54:03] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20343 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 9 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-20 17:54:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 17:54:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-20 17:54:04] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:54:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 17:54:04] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:54:04] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 17:54:04] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 642 reset in 697 ms.
Product exploration explored 100000 steps with 637 reset in 742 ms.
Built C files in :
/tmp/ltsmin13687455348565960560
[2024-05-20 17:54:05] [INFO ] Too many transitions (3694) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:54:05] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13687455348565960560
Running compilation step : cd /tmp/ltsmin13687455348565960560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13687455348565960560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13687455348565960560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 64 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-20 17:54:09] [INFO ] Computed 32 invariants in 48 ms
[2024-05-20 17:54:09] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-20 17:54:09] [INFO ] Invariant cache hit.
[2024-05-20 17:54:10] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-20 17:54:15] [INFO ] Implicit Places using invariants and state equation in 5702 ms returned []
Implicit Place search using SMT with State Equation took 6259 ms to find 0 implicit places.
[2024-05-20 17:54:15] [INFO ] Redundant transitions in 110 ms returned []
[2024-05-20 17:54:15] [INFO ] Invariant cache hit.
[2024-05-20 17:54:16] [INFO ] Dead Transitions using invariants and state equation in 1282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7721 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Built C files in :
/tmp/ltsmin12728508680109495262
[2024-05-20 17:54:16] [INFO ] Too many transitions (3694) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:54:16] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12728508680109495262
Running compilation step : cd /tmp/ltsmin12728508680109495262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12728508680109495262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12728508680109495262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 17:54:19] [INFO ] Flatten gal took : 80 ms
[2024-05-20 17:54:19] [INFO ] Flatten gal took : 74 ms
[2024-05-20 17:54:19] [INFO ] Time to serialize gal into /tmp/LTL13314496899090775811.gal : 19 ms
[2024-05-20 17:54:19] [INFO ] Time to serialize properties into /tmp/LTL16074180677302617556.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13314496899090775811.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8305057379578174005.hoa' '-atoms' '/tmp/LTL16074180677302617556.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16074180677302617556.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8305057379578174005.hoa
Detected timeout of ITS tools.
[2024-05-20 17:54:35] [INFO ] Flatten gal took : 61 ms
[2024-05-20 17:54:35] [INFO ] Flatten gal took : 67 ms
[2024-05-20 17:54:35] [INFO ] Time to serialize gal into /tmp/LTL8855249462106542200.gal : 11 ms
[2024-05-20 17:54:35] [INFO ] Time to serialize properties into /tmp/LTL13232001432664448081.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8855249462106542200.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13232001432664448081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4GiveAnswer9<1)||(Node3IsInserted<1))")||(("(Node0requestsent3<1)")||(G("((Node9ID2<1)&&((Node9IsInserted<1)||(Node22re...178
Formula 0 simplified : XF(!"((Node4GiveAnswer9<1)||(Node3IsInserted<1))" & !"(Node0requestsent3<1)" & F!"((Node9ID2<1)&&((Node9IsInserted<1)||(Node22reques...168
Detected timeout of ITS tools.
[2024-05-20 17:54:50] [INFO ] Flatten gal took : 62 ms
[2024-05-20 17:54:50] [INFO ] Applying decomposition
[2024-05-20 17:54:50] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13665369374157345170.txt' '-o' '/tmp/graph13665369374157345170.bin' '-w' '/tmp/graph13665369374157345170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13665369374157345170.bin' '-l' '-1' '-v' '-w' '/tmp/graph13665369374157345170.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:54:50] [INFO ] Decomposing Gal with order
[2024-05-20 17:54:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:54:50] [INFO ] Removed a total of 2709 redundant transitions.
[2024-05-20 17:54:50] [INFO ] Flatten gal took : 221 ms
[2024-05-20 17:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1741 labels/synchronizations in 94 ms.
[2024-05-20 17:54:51] [INFO ] Time to serialize gal into /tmp/LTL1014524760866614999.gal : 15 ms
[2024-05-20 17:54:51] [INFO ] Time to serialize properties into /tmp/LTL13879692701765709650.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1014524760866614999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13879692701765709650.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u11.Node4GiveAnswer9<1)||(u4.Node3IsInserted<1))")||(("(u1.Node0requestsent3<1)")||(G("((i9.u10.Node9ID2<1)&&((u11.Node9IsI...203
Formula 0 simplified : XF(!"((u11.Node4GiveAnswer9<1)||(u4.Node3IsInserted<1))" & !"(u1.Node0requestsent3<1)" & F!"((i9.u10.Node9ID2<1)&&((u11.Node9IsInser...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7120105113876757221
[2024-05-20 17:55:06] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7120105113876757221
Running compilation step : cd /tmp/ltsmin7120105113876757221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7120105113876757221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7120105113876757221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 147475 ms.
[2024-05-20 17:55:09] [INFO ] Flatten gal took : 97 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12855392973223349358
[2024-05-20 17:55:09] [INFO ] Too many transitions (5580) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:55:09] [INFO ] Applying decomposition
[2024-05-20 17:55:09] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12855392973223349358
Running compilation step : cd /tmp/ltsmin12855392973223349358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 17:55:09] [INFO ] Flatten gal took : 103 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11877650880312686413.txt' '-o' '/tmp/graph11877650880312686413.bin' '-w' '/tmp/graph11877650880312686413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11877650880312686413.bin' '-l' '-1' '-v' '-w' '/tmp/graph11877650880312686413.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:55:09] [INFO ] Decomposing Gal with order
[2024-05-20 17:55:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:55:10] [INFO ] Removed a total of 2709 redundant transitions.
[2024-05-20 17:55:10] [INFO ] Flatten gal took : 227 ms
[2024-05-20 17:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2436 labels/synchronizations in 128 ms.
[2024-05-20 17:55:10] [INFO ] Time to serialize gal into /tmp/LTLFireability15577334624293546536.gal : 25 ms
[2024-05-20 17:55:10] [INFO ] Time to serialize properties into /tmp/LTLFireability10772417958315636125.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15577334624293546536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10772417958315636125.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u39.Node4GiveAnswer9<1)||(i4.i0.u12.Node3IsInserted<1))")||(("(u3.Node0requestsent3<1)")||(G("((i18.u38.Node9ID2<1)&&((i18....215
Formula 0 simplified : XF(!"((u39.Node4GiveAnswer9<1)||(i4.i0.u12.Node3IsInserted<1))" & !"(u3.Node0requestsent3<1)" & F!"((i18.u38.Node9ID2<1)&&((i18.u36....205
Compilation finished in 17444 ms.
Running link step : cd /tmp/ltsmin12855392973223349358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin12855392973223349358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 18:17:34] [INFO ] Flatten gal took : 380 ms
[2024-05-20 18:17:34] [INFO ] Time to serialize gal into /tmp/LTLFireability6335106675036990944.gal : 43 ms
[2024-05-20 18:17:34] [INFO ] Time to serialize properties into /tmp/LTLFireability15538895103719522986.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6335106675036990944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15538895103719522986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4GiveAnswer9<1)||(Node3IsInserted<1))")||(("(Node0requestsent3<1)")||(G("((Node9ID2<1)&&((Node9IsInserted<1)||(Node22re...178
Formula 0 simplified : XF(!"((Node4GiveAnswer9<1)||(Node3IsInserted<1))" & !"(Node0requestsent3<1)" & F!"((Node9ID2<1)&&((Node9IsInserted<1)||(Node22reques...168
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.051: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.051: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.051: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.051: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.068: LTL layer: formula: X([](([]((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 3/ 8), 0.068: "X([](([]((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.070: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.227: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.245: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.253: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.359: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.216: DFS-FIFO for weak LTL, using special progress label 5583
pins2lts-mc-linux64( 0/ 8), 3.216: There are 5584 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.216: State length is 2164, there are 5587 groups
pins2lts-mc-linux64( 0/ 8), 3.216: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.216: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.216: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 3.216: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 3.858: ~1 levels ~960 states ~21120 transitions
pins2lts-mc-linux64( 5/ 8), 4.542: ~1 levels ~1920 states ~48960 transitions
pins2lts-mc-linux64( 5/ 8), 5.784: ~1 levels ~3840 states ~104640 transitions
pins2lts-mc-linux64( 7/ 8), 8.364: ~1 levels ~7680 states ~222720 transitions
pins2lts-mc-linux64( 4/ 8), 13.224: ~1 levels ~15360 states ~445440 transitions
pins2lts-mc-linux64( 3/ 8), 46.350: ~1 levels ~30720 states ~889544 transitions
pins2lts-mc-linux64( 3/ 8), 92.610: ~1 levels ~61440 states ~1780424 transitions
pins2lts-mc-linux64( 1/ 8), 129.653: ~1 levels ~122880 states ~3562184 transitions
pins2lts-mc-linux64( 1/ 8), 202.206: ~1 levels ~245760 states ~7125704 transitions
pins2lts-mc-linux64( 7/ 8), 345.807: ~1 levels ~491520 states ~14254080 transitions
pins2lts-mc-linux64( 6/ 8), 643.587: ~1 levels ~983040 states ~28508176 transitions
pins2lts-mc-linux64( 6/ 8), 1214.970: ~1 levels ~1966080 states ~57016352 transitions
pins2lts-mc-linux64( 3/ 8), 1960.131: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1960.354:
pins2lts-mc-linux64( 0/ 8), 1960.354: mean standard work distribution: 0.2% (states) 0.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 1960.354:
pins2lts-mc-linux64( 0/ 8), 1960.354: Explored 3228695 states 93629654 transitions, fanout: 28.999
pins2lts-mc-linux64( 0/ 8), 1960.354: Total exploration time 1957.130 sec (1956.920 sec minimum, 1957.006 sec on average)
pins2lts-mc-linux64( 0/ 8), 1960.354: States per second: 1650, Transitions per second: 47840
pins2lts-mc-linux64( 0/ 8), 1960.354:
pins2lts-mc-linux64( 0/ 8), 1960.354: Progress states detected: 19478550
pins2lts-mc-linux64( 0/ 8), 1960.354: Redundant explorations: -83.4245
pins2lts-mc-linux64( 0/ 8), 1960.354:
pins2lts-mc-linux64( 0/ 8), 1960.354: Queue width: 8B, total height: 22127424, memory: 168.82MB
pins2lts-mc-linux64( 0/ 8), 1960.354: Tree memory: 404.6MB, 21.8 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1960.354: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1960.354: Stored 5697 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1960.354: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1960.354: Est. total memory use: 573.4MB (~1192.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12855392973223349358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12855392973223349358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-20 18:40:03] [INFO ] Flatten gal took : 243 ms
[2024-05-20 18:40:06] [INFO ] Input system was already deterministic with 5580 transitions.
[2024-05-20 18:40:06] [INFO ] Transformed 2163 places.
[2024-05-20 18:40:06] [INFO ] Transformed 5580 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 18:40:07] [INFO ] Time to serialize gal into /tmp/LTLFireability2054209753386165711.gal : 31 ms
[2024-05-20 18:40:07] [INFO ] Time to serialize properties into /tmp/LTLFireability10657597829676252991.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2054209753386165711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10657597829676252991.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("((Node4GiveAnswer9<1)||(Node3IsInserted<1))")||(("(Node0requestsent3<1)")||(G("((Node9ID2<1)&&((Node9IsInserted<1)||(Node22re...178
Formula 0 simplified : XF(!"((Node4GiveAnswer9<1)||(Node3IsInserted<1))" & !"(Node0requestsent3<1)" & F!"((Node9ID2<1)&&((Node9IsInserted<1)||(Node22reques...168
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 4119124 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15829440 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-030, 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 r087-tall-171620521400073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 ;