About the Execution of 2023-gold for CANInsertWithFailure-PT-070
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16213.947 | 3600000.00 | 3923436.00 | 47079.50 | ?FT?FF?FTFFF?FFF | 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-171620521500092.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-070, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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.1K 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 30M 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-070-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716235666141
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 20:07:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 20:07:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:07:48] [INFO ] Load time of PNML (sax parser for PT used): 726 ms
[2024-05-20 20:07:48] [INFO ] Transformed 10644 places.
[2024-05-20 20:07:48] [INFO ] Transformed 29820 transitions.
[2024-05-20 20:07:48] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 908 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 3218 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-20 20:07:58] [INFO ] Computed 72 invariants in 6104 ms
[2024-05-20 20:07:59] [INFO ] Implicit Places using invariants in 7274 ms returned []
Implicit Place search using SMT only with invariants took 7300 ms to find 0 implicit places.
[2024-05-20 20:07:59] [INFO ] Invariant cache hit.
[2024-05-20 20:08:00] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11552 ms. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 42 out of 10643 places after structural reductions.
[2024-05-20 20:08:01] [INFO ] Flatten gal took : 1021 ms
[2024-05-20 20:08:02] [INFO ] Flatten gal took : 752 ms
[2024-05-20 20:08:03] [INFO ] Input system was already deterministic with 29820 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2024-05-20 20:08:04] [INFO ] Invariant cache hit.
[2024-05-20 20:08:09] [INFO ] After 4371ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:24
[2024-05-20 20:08:13] [INFO ] [Nat]Absence check using 70 positive place invariants in 121 ms returned sat
[2024-05-20 20:08:13] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 191 ms returned sat
[2024-05-20 20:08:34] [INFO ] After 17695ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2024-05-20 20:08:34] [INFO ] State equation strengthened by 9730 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:08:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:08:34] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:24
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 39 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4742 Post agglomeration using F-continuation condition.Transition count delta: 4742
Deduced a syphon composed of 4742 places in 15 ms
Reduce places removed 4742 places and 0 transitions.
Iterating global reduction 2 with 9484 rules applied. Total rules applied 10464 place count 5411 transition count 24588
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10465 place count 5411 transition count 24587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10466 place count 5410 transition count 24587
Partial Free-agglomeration rule applied 5089 times.
Drop transitions removed 5089 transitions
Iterating global reduction 3 with 5089 rules applied. Total rules applied 15555 place count 5410 transition count 24587
Applied a total of 15555 rules in 9361 ms. Remains 5410 /10643 variables (removed 5233) and now considering 24587/29820 (removed 5233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9365 ms. Remains : 5410/10643 places, 24587/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-20 20:08:44] [INFO ] Flow matrix only has 24571 transitions (discarded 16 similar events)
// Phase 1: matrix 24571 rows 5410 cols
[2024-05-20 20:08:46] [INFO ] Computed 72 invariants in 1524 ms
[2024-05-20 20:08:47] [INFO ] After 1893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-20 20:08:49] [INFO ] [Nat]Absence check using 70 positive place invariants in 58 ms returned sat
[2024-05-20 20:08:49] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-20 20:09:12] [INFO ] After 21531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-20 20:09:12] [INFO ] State equation strengthened by 24216 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:09:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:09:12] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 32 out of 5410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5410/5410 places, 24587/24587 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5409 transition count 24586
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 5409 transition count 24586
Applied a total of 9 rules in 4589 ms. Remains 5409 /5410 variables (removed 1) and now considering 24586/24587 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4590 ms. Remains : 5409/5410 places, 24586/24587 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-20 20:09:18] [INFO ] Flow matrix only has 24575 transitions (discarded 11 similar events)
// Phase 1: matrix 24575 rows 5409 cols
[2024-05-20 20:09:19] [INFO ] Computed 72 invariants in 1417 ms
[2024-05-20 20:09:21] [INFO ] After 1658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-20 20:09:22] [INFO ] [Nat]Absence check using 70 positive place invariants in 48 ms returned sat
[2024-05-20 20:09:22] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 72 ms returned sat
[2024-05-20 20:09:42] [INFO ] After 18362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-20 20:09:42] [INFO ] State equation strengthened by 24230 read => feed constraints.
[2024-05-20 20:09:46] [INFO ] After 3535ms SMT Verify possible using 24230 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-20 20:09:46] [INFO ] After 3537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-20 20:09:46] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 26 out of 5409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5409/5409 places, 24586/24586 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5407 transition count 24584
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5407 transition count 24584
Applied a total of 8 rules in 4401 ms. Remains 5407 /5409 variables (removed 2) and now considering 24584/24586 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4401 ms. Remains : 5407/5409 places, 24584/24586 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 282 stabilizing places and 490 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' '!(G(F((p0||(p1 U p2)))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 15 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 2 with 9654 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Applied a total of 10634 rules in 5273 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
[2024-05-20 20:09:56] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
// Phase 1: matrix 19814 rows 5326 cols
[2024-05-20 20:09:57] [INFO ] Computed 72 invariants in 1665 ms
[2024-05-20 20:09:59] [INFO ] Implicit Places using invariants in 3115 ms returned []
Implicit Place search using SMT only with invariants took 3116 ms to find 0 implicit places.
[2024-05-20 20:09:59] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-20 20:09:59] [INFO ] Invariant cache hit.
[2024-05-20 20:10:13] [INFO ] Dead Transitions using invariants and state equation in 13787 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/10643 places, 24503/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22179 ms. Remains : 5326/10643 places, 24503/29820 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 208 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 2 s2616), p0:(AND (LEQ s3720 s657) (OR (GT 2 s4127) (LEQ 2 s4127)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 283 reset in 2804 ms.
Product exploration explored 100000 steps with 284 reset in 2860 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 53489 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53489 steps, saw 38885 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:10:22] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-20 20:10:22] [INFO ] Invariant cache hit.
[2024-05-20 20:10:23] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:10:23] [INFO ] [Nat]Absence check using 70 positive place invariants in 63 ms returned sat
[2024-05-20 20:10:23] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 81 ms returned sat
[2024-05-20 20:10:34] [INFO ] After 10011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:10:34] [INFO ] State equation strengthened by 14625 read => feed constraints.
[2024-05-20 20:10:44] [INFO ] After 9950ms SMT Verify possible using 14625 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-20 20:10:44] [INFO ] After 20818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5326 transition count 24502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5325 transition count 24502
Applied a total of 4972 rules in 3870 ms. Remains 5325 /5326 variables (removed 1) and now considering 24502/24503 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3871 ms. Remains : 5325/5326 places, 24502/24503 transitions.
Finished random walk after 397 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 5326 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1124 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-20 20:10:49] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-20 20:10:49] [INFO ] Invariant cache hit.
[2024-05-20 20:10:50] [INFO ] Implicit Places using invariants in 1306 ms returned []
Implicit Place search using SMT only with invariants took 1307 ms to find 0 implicit places.
[2024-05-20 20:10:50] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-20 20:10:50] [INFO ] Invariant cache hit.
[2024-05-20 20:11:03] [INFO ] Dead Transitions using invariants and state equation in 12701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15134 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 53885 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53885 steps, saw 38954 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:11:07] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-20 20:11:07] [INFO ] Invariant cache hit.
[2024-05-20 20:11:07] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:11:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 52 ms returned sat
[2024-05-20 20:11:08] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 72 ms returned sat
[2024-05-20 20:11:17] [INFO ] After 9555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:11:18] [INFO ] State equation strengthened by 14625 read => feed constraints.
[2024-05-20 20:11:28] [INFO ] After 10032ms SMT Verify possible using 14625 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-20 20:11:28] [INFO ] After 20459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5326 transition count 24502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5325 transition count 24502
Applied a total of 4972 rules in 3739 ms. Remains 5325 /5326 variables (removed 1) and now considering 24502/24503 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3740 ms. Remains : 5325/5326 places, 24502/24503 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 66367 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66367 steps, saw 52243 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:11:35] [INFO ] Flow matrix only has 24501 transitions (discarded 1 similar events)
// Phase 1: matrix 24501 rows 5325 cols
[2024-05-20 20:11:36] [INFO ] Computed 72 invariants in 1228 ms
[2024-05-20 20:11:36] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:11:37] [INFO ] [Nat]Absence check using 70 positive place invariants in 47 ms returned sat
[2024-05-20 20:11:37] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 76 ms returned sat
[2024-05-20 20:11:48] [INFO ] After 10875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:11:48] [INFO ] State equation strengthened by 24282 read => feed constraints.
[2024-05-20 20:11:51] [INFO ] After 3026ms SMT Verify possible using 24282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:11:52] [INFO ] After 3948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 720 ms.
[2024-05-20 20:11:53] [INFO ] After 16505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1560 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1560 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1503 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2024-05-20 20:11:56] [INFO ] Flow matrix only has 24501 transitions (discarded 1 similar events)
[2024-05-20 20:11:56] [INFO ] Invariant cache hit.
[2024-05-20 20:12:01] [INFO ] Implicit Places using invariants in 4489 ms returned []
Implicit Place search using SMT only with invariants took 4492 ms to find 0 implicit places.
[2024-05-20 20:12:01] [INFO ] Flow matrix only has 24501 transitions (discarded 1 similar events)
[2024-05-20 20:12:01] [INFO ] Invariant cache hit.
[2024-05-20 20:12:14] [INFO ] Dead Transitions using invariants and state equation in 13033 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19035 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Graph (trivial) has 24066 edges and 5325 vertex of which 5038 / 5325 are part of one of the 2 SCC in 7 ms
Free SCC test removed 5036 places
Drop transitions removed 19241 transitions
Ensure Unique test removed 4963 transitions
Reduce isomorphic transitions removed 24204 transitions.
Graph (complete) has 720 edges and 289 vertex of which 78 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.1 ms
Discarding 211 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 141 transitions
Reduce isomorphic transitions removed 141 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 142 rules applied. Total rules applied 144 place count 78 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 145 place count 77 transition count 87
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 213 place count 9 transition count 19
Iterating global reduction 2 with 68 rules applied. Total rules applied 281 place count 9 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 9 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 9 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 8 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 7 transition count 14
Applied a total of 287 rules in 93 ms. Remains 7 /5325 variables (removed 5318) and now considering 14/24502 (removed 24488) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 14 rows 7 cols
[2024-05-20 20:12:14] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 20:12:14] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:12:14] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:12:14] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 20:12:14] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 284 reset in 2277 ms.
Product exploration explored 100000 steps with 284 reset in 2320 ms.
Built C files in :
/tmp/ltsmin3256147494078852618
[2024-05-20 20:12:19] [INFO ] Too many transitions (24503) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:12:19] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3256147494078852618
Running compilation step : cd /tmp/ltsmin3256147494078852618;'/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/ltsmin3256147494078852618;'/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/ltsmin3256147494078852618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1373 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-20 20:12:23] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
// Phase 1: matrix 19814 rows 5326 cols
[2024-05-20 20:12:25] [INFO ] Computed 72 invariants in 1653 ms
[2024-05-20 20:12:26] [INFO ] Implicit Places using invariants in 2904 ms returned []
Implicit Place search using SMT only with invariants took 2907 ms to find 0 implicit places.
[2024-05-20 20:12:26] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-20 20:12:26] [INFO ] Invariant cache hit.
[2024-05-20 20:12:40] [INFO ] Dead Transitions using invariants and state equation in 13600 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17885 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Built C files in :
/tmp/ltsmin10075178061750482092
[2024-05-20 20:12:40] [INFO ] Too many transitions (24503) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:12:40] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10075178061750482092
Running compilation step : cd /tmp/ltsmin10075178061750482092;'/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/ltsmin10075178061750482092;'/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/ltsmin10075178061750482092;'/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 20:12:44] [INFO ] Flatten gal took : 456 ms
[2024-05-20 20:12:45] [INFO ] Flatten gal took : 411 ms
[2024-05-20 20:12:45] [INFO ] Time to serialize gal into /tmp/LTL15433119248197955771.gal : 102 ms
[2024-05-20 20:12:45] [INFO ] Time to serialize properties into /tmp/LTL14292299919477396335.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15433119248197955771.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14597465500617969502.hoa' '-atoms' '/tmp/LTL14292299919477396335.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...320
Loading property file /tmp/LTL14292299919477396335.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14597465500617969502.hoa
Detected timeout of ITS tools.
[2024-05-20 20:13:00] [INFO ] Flatten gal took : 373 ms
[2024-05-20 20:13:01] [INFO ] Flatten gal took : 393 ms
[2024-05-20 20:13:02] [INFO ] Time to serialize gal into /tmp/LTL2093597259717109041.gal : 1246 ms
[2024-05-20 20:13:02] [INFO ] Time to serialize properties into /tmp/LTL15942127619428396436.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2093597259717109041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15942127619428396436.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((("(Node50requestsent52>=3)")U("(Node31GiveAnswer22>=2)"))||("((Node47GiveAnswer5<=Node3requestsent25)&&((Node52GiveAnswer62<2)...188
Formula 0 simplified : FG(!"((Node47GiveAnswer5<=Node3requestsent25)&&((Node52GiveAnswer62<2)||(Node52GiveAnswer62>=2)))" & (!"(Node50requestsent52>=3)" R ...183
Detected timeout of ITS tools.
[2024-05-20 20:13:17] [INFO ] Flatten gal took : 399 ms
[2024-05-20 20:13:17] [INFO ] Applying decomposition
[2024-05-20 20:13:18] [INFO ] Flatten gal took : 432 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/graph7777973528900499609.txt' '-o' '/tmp/graph7777973528900499609.bin' '-w' '/tmp/graph7777973528900499609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7777973528900499609.bin' '-l' '-1' '-v' '-w' '/tmp/graph7777973528900499609.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:13:19] [INFO ] Decomposing Gal with order
[2024-05-20 20:13:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:13:22] [INFO ] Removed a total of 19425 redundant transitions.
[2024-05-20 20:13:23] [INFO ] Flatten gal took : 3184 ms
[2024-05-20 20:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 14350 labels/synchronizations in 3871 ms.
[2024-05-20 20:13:29] [INFO ] Time to serialize gal into /tmp/LTL11797010521815856312.gal : 117 ms
[2024-05-20 20:13:29] [INFO ] Time to serialize properties into /tmp/LTL17002337682569418593.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/LTL11797010521815856312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17002337682569418593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((("(gi0.gu51.Node50requestsent52>=3)")U("(gi0.gu23.Node31GiveAnswer22>=2)"))||("((gu71.Node47GiveAnswer5<=gu71.Node3requestsent...234
Formula 0 simplified : FG(!"((gu71.Node47GiveAnswer5<=gu71.Node3requestsent25)&&((gi0.gu63.Node52GiveAnswer62<2)||(gi0.gu63.Node52GiveAnswer62>=2)))" & (!"...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2927464132621757565
[2024-05-20 20:13:44] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2927464132621757565
Running compilation step : cd /tmp/ltsmin2927464132621757565;'/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/ltsmin2927464132621757565;'/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/ltsmin2927464132621757565;'/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-070-LTLCardinality-00 finished in 236410 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 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2118 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-20 20:13:54] [INFO ] Computed 72 invariants in 5037 ms
[2024-05-20 20:13:55] [INFO ] Implicit Places using invariants in 5976 ms returned []
Implicit Place search using SMT only with invariants took 5977 ms to find 0 implicit places.
[2024-05-20 20:13:55] [INFO ] Invariant cache hit.
[2024-05-20 20:13:56] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9052 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5907 s10334)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 6204 ms.
Product exploration explored 100000 steps with 50000 reset in 6295 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-02 finished in 21789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 9 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 5483 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-20 20:14:14] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-20 20:14:16] [INFO ] Computed 72 invariants in 1638 ms
[2024-05-20 20:14:17] [INFO ] Implicit Places using invariants in 2943 ms returned []
Implicit Place search using SMT only with invariants took 2947 ms to find 0 implicit places.
[2024-05-20 20:14:17] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-20 20:14:17] [INFO ] Invariant cache hit.
[2024-05-20 20:14:31] [INFO ] Dead Transitions using invariants and state equation in 13756 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22188 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1437 s3831)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 285 reset in 2089 ms.
Product exploration explored 100000 steps with 284 reset in 2114 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 54074 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54074 steps, saw 38980 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:14:39] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-20 20:14:39] [INFO ] Invariant cache hit.
[2024-05-20 20:14:39] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:14:40] [INFO ] [Nat]Absence check using 70 positive place invariants in 52 ms returned sat
[2024-05-20 20:14:40] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-20 20:14:53] [INFO ] After 12657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:14:53] [INFO ] State equation strengthened by 14627 read => feed constraints.
[2024-05-20 20:14:58] [INFO ] After 4934ms SMT Verify possible using 14627 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:14:59] [INFO ] After 5748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 637 ms.
[2024-05-20 20:14:59] [INFO ] After 19872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5324 transition count 24500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5323 transition count 24500
Applied a total of 4972 rules in 3748 ms. Remains 5323 /5324 variables (removed 1) and now considering 24500/24501 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3749 ms. Remains : 5323/5324 places, 24500/24501 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 66733 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66733 steps, saw 52295 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:15:06] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2024-05-20 20:15:07] [INFO ] Computed 72 invariants in 1261 ms
[2024-05-20 20:15:08] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:15:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 51 ms returned sat
[2024-05-20 20:15:09] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-20 20:15:18] [INFO ] After 9791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:15:19] [INFO ] State equation strengthened by 24286 read => feed constraints.
[2024-05-20 20:15:21] [INFO ] After 2847ms SMT Verify possible using 24286 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:15:22] [INFO ] After 3706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 646 ms.
[2024-05-20 20:15:23] [INFO ] After 15005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1432 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1434 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1430 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-20 20:15:26] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-20 20:15:26] [INFO ] Invariant cache hit.
[2024-05-20 20:15:30] [INFO ] Implicit Places using invariants in 4379 ms returned []
Implicit Place search using SMT only with invariants took 4380 ms to find 0 implicit places.
[2024-05-20 20:15:30] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-20 20:15:30] [INFO ] Invariant cache hit.
[2024-05-20 20:15:44] [INFO ] Dead Transitions using invariants and state equation in 13632 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19446 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Graph (trivial) has 24072 edges and 5323 vertex of which 5038 / 5323 are part of one of the 2 SCC in 4 ms
Free SCC test removed 5036 places
Drop transitions removed 19245 transitions
Ensure Unique test removed 4963 transitions
Reduce isomorphic transitions removed 24208 transitions.
Graph (complete) has 714 edges and 287 vertex of which 76 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.0 ms
Discarding 211 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 141 transitions
Reduce isomorphic transitions removed 141 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 142 rules applied. Total rules applied 144 place count 76 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 145 place count 75 transition count 81
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 213 place count 7 transition count 13
Iterating global reduction 2 with 68 rules applied. Total rules applied 281 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 5 transition count 8
Applied a total of 287 rules in 60 ms. Remains 5 /5323 variables (removed 5318) and now considering 8/24500 (removed 24492) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 20:15:44] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:15:44] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:15:44] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:15:44] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 20:15:44] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1080 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-20 20:15:45] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-20 20:15:47] [INFO ] Computed 72 invariants in 1603 ms
[2024-05-20 20:15:48] [INFO ] Implicit Places using invariants in 2847 ms returned []
Implicit Place search using SMT only with invariants took 2848 ms to find 0 implicit places.
[2024-05-20 20:15:48] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-20 20:15:48] [INFO ] Invariant cache hit.
[2024-05-20 20:16:01] [INFO ] Dead Transitions using invariants and state equation in 13095 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17024 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 54295 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54295 steps, saw 39012 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:16:05] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-20 20:16:05] [INFO ] Invariant cache hit.
[2024-05-20 20:16:05] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:16:06] [INFO ] [Nat]Absence check using 70 positive place invariants in 49 ms returned sat
[2024-05-20 20:16:06] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-20 20:16:18] [INFO ] After 12062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:16:18] [INFO ] State equation strengthened by 14627 read => feed constraints.
[2024-05-20 20:16:23] [INFO ] After 4428ms SMT Verify possible using 14627 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:16:23] [INFO ] After 5227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 614 ms.
[2024-05-20 20:16:24] [INFO ] After 18727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5324 transition count 24500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5323 transition count 24500
Applied a total of 4972 rules in 3638 ms. Remains 5323 /5324 variables (removed 1) and now considering 24500/24501 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3638 ms. Remains : 5323/5324 places, 24500/24501 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 66970 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66970 steps, saw 52324 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:16:31] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2024-05-20 20:16:32] [INFO ] Computed 72 invariants in 1193 ms
[2024-05-20 20:16:33] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:16:33] [INFO ] [Nat]Absence check using 70 positive place invariants in 52 ms returned sat
[2024-05-20 20:16:33] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-20 20:16:43] [INFO ] After 9973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:16:43] [INFO ] State equation strengthened by 24286 read => feed constraints.
[2024-05-20 20:16:46] [INFO ] After 2777ms SMT Verify possible using 24286 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:16:47] [INFO ] After 3626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 644 ms.
[2024-05-20 20:16:48] [INFO ] After 15102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1403 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1403 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1388 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-20 20:16:50] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-20 20:16:50] [INFO ] Invariant cache hit.
[2024-05-20 20:16:55] [INFO ] Implicit Places using invariants in 4352 ms returned []
Implicit Place search using SMT only with invariants took 4353 ms to find 0 implicit places.
[2024-05-20 20:16:55] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-20 20:16:55] [INFO ] Invariant cache hit.
[2024-05-20 20:17:08] [INFO ] Dead Transitions using invariants and state equation in 13614 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19358 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Graph (trivial) has 24072 edges and 5323 vertex of which 5038 / 5323 are part of one of the 2 SCC in 4 ms
Free SCC test removed 5036 places
Drop transitions removed 19245 transitions
Ensure Unique test removed 4963 transitions
Reduce isomorphic transitions removed 24208 transitions.
Graph (complete) has 714 edges and 287 vertex of which 76 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.0 ms
Discarding 211 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 141 transitions
Reduce isomorphic transitions removed 141 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 142 rules applied. Total rules applied 144 place count 76 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 145 place count 75 transition count 81
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 213 place count 7 transition count 13
Iterating global reduction 2 with 68 rules applied. Total rules applied 281 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 5 transition count 8
Applied a total of 287 rules in 57 ms. Remains 5 /5323 variables (removed 5318) and now considering 8/24500 (removed 24492) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 20:17:09] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:17:09] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:17:09] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:17:09] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 20:17:09] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 286 reset in 2070 ms.
Product exploration explored 100000 steps with 287 reset in 2125 ms.
Built C files in :
/tmp/ltsmin11332976608324366013
[2024-05-20 20:17:13] [INFO ] Too many transitions (24501) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:17:13] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11332976608324366013
Running compilation step : cd /tmp/ltsmin11332976608324366013;'/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/ltsmin11332976608324366013;'/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/ltsmin11332976608324366013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1039 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-20 20:17:18] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-20 20:17:19] [INFO ] Computed 72 invariants in 1589 ms
[2024-05-20 20:17:20] [INFO ] Implicit Places using invariants in 2920 ms returned []
Implicit Place search using SMT only with invariants took 2927 ms to find 0 implicit places.
[2024-05-20 20:17:20] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-20 20:17:20] [INFO ] Invariant cache hit.
[2024-05-20 20:17:34] [INFO ] Dead Transitions using invariants and state equation in 13664 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17633 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Built C files in :
/tmp/ltsmin16162916407005323727
[2024-05-20 20:17:34] [INFO ] Too many transitions (24501) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:17:34] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16162916407005323727
Running compilation step : cd /tmp/ltsmin16162916407005323727;'/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/ltsmin16162916407005323727;'/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/ltsmin16162916407005323727;'/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 20:17:38] [INFO ] Flatten gal took : 625 ms
[2024-05-20 20:17:39] [INFO ] Flatten gal took : 408 ms
[2024-05-20 20:17:39] [INFO ] Time to serialize gal into /tmp/LTL18330270172203315586.gal : 87 ms
[2024-05-20 20:17:39] [INFO ] Time to serialize properties into /tmp/LTL7582677605526744567.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18330270172203315586.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14557398868812338132.hoa' '-atoms' '/tmp/LTL7582677605526744567.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/LTL7582677605526744567.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14557398868812338132.hoa
Detected timeout of ITS tools.
[2024-05-20 20:17:55] [INFO ] Flatten gal took : 390 ms
[2024-05-20 20:17:55] [INFO ] Flatten gal took : 416 ms
[2024-05-20 20:17:55] [INFO ] Time to serialize gal into /tmp/LTL13324801808968701232.gal : 72 ms
[2024-05-20 20:17:55] [INFO ] Time to serialize properties into /tmp/LTL12347360237856849311.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/LTL13324801808968701232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12347360237856849311.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node14requestsent35<=Node48GiveAnswer47)"))))
Formula 0 simplified : FG!"(Node14requestsent35<=Node48GiveAnswer47)"
Detected timeout of ITS tools.
[2024-05-20 20:18:10] [INFO ] Flatten gal took : 387 ms
[2024-05-20 20:18:10] [INFO ] Applying decomposition
[2024-05-20 20:18:11] [INFO ] Flatten gal took : 400 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/graph4843812908327175680.txt' '-o' '/tmp/graph4843812908327175680.bin' '-w' '/tmp/graph4843812908327175680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4843812908327175680.bin' '-l' '-1' '-v' '-w' '/tmp/graph4843812908327175680.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:18:12] [INFO ] Decomposing Gal with order
[2024-05-20 20:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:18:15] [INFO ] Removed a total of 19430 redundant transitions.
[2024-05-20 20:18:15] [INFO ] Flatten gal took : 2590 ms
[2024-05-20 20:18:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 14352 labels/synchronizations in 3587 ms.
[2024-05-20 20:18:20] [INFO ] Time to serialize gal into /tmp/LTL1161350037728041380.gal : 596 ms
[2024-05-20 20:18:20] [INFO ] Time to serialize properties into /tmp/LTL12063321978285429739.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/LTL1161350037728041380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12063321978285429739.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu71.Node14requestsent35<=gu71.Node48GiveAnswer47)"))))
Formula 0 simplified : FG!"(gu71.Node14requestsent35<=gu71.Node48GiveAnswer47)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12662000718817081950
[2024-05-20 20:18:35] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12662000718817081950
Running compilation step : cd /tmp/ltsmin12662000718817081950;'/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/ltsmin12662000718817081950;'/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/ltsmin12662000718817081950;'/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-070-LTLCardinality-03 finished in 269614 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)&&F(G(p1)))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2037 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-20 20:18:45] [INFO ] Computed 72 invariants in 4742 ms
[2024-05-20 20:18:49] [INFO ] Implicit Places using invariants in 8605 ms returned []
Implicit Place search using SMT only with invariants took 8606 ms to find 0 implicit places.
[2024-05-20 20:18:49] [INFO ] Invariant cache hit.
[2024-05-20 20:18:50] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11535 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s6270 s1987), p1:(LEQ s683 s7113)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1378 steps with 0 reset in 21 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-04 finished in 11774 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(X(p1))||G(p0))) U (p2&&X(p1))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2049 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-20 20:18:52] [INFO ] Invariant cache hit.
[2024-05-20 20:18:53] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
[2024-05-20 20:18:53] [INFO ] Invariant cache hit.
[2024-05-20 20:18:54] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3805 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 1218 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 4}, { cond=p2, acceptance={0} source=0 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p0), acceptance={} source=10 dest: 8}, { cond=p0, acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(LEQ 2 s1116), p0:(LEQ 3 s5938), p1:(LEQ 1 s4988)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1657 steps with 0 reset in 27 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-05 finished in 5124 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)||F((p1||(X(!p0) U ((X(!p0)&&G(p2))||X(G(!p0)))))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2067 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-20 20:18:57] [INFO ] Invariant cache hit.
[2024-05-20 20:18:58] [INFO ] Implicit Places using invariants in 856 ms returned []
Implicit Place search using SMT only with invariants took 857 ms to find 0 implicit places.
[2024-05-20 20:18:58] [INFO ] Invariant cache hit.
[2024-05-20 20:18:59] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3802 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 272 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s849), p2:(GT 3 s1654), p0:(LEQ 3 s5986)], 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]]
Product exploration explored 100000 steps with 592 reset in 1530 ms.
Product exploration explored 100000 steps with 617 reset in 1568 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2024-05-20 20:19:03] [INFO ] Invariant cache hit.
[2024-05-20 20:19:05] [INFO ] [Real]Absence check using 70 positive place invariants in 92 ms returned sat
[2024-05-20 20:19:05] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 175 ms returned sat
[2024-05-20 20:19:28] [INFO ] After 22738ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-20 20:19:28] [INFO ] State equation strengthened by 9730 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:19:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:19:28] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 9 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 3 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10633 place count 5327 transition count 24503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions removed 4972 transitions
Iterating global reduction 4 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 9068 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9068 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 62110 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62110 steps, saw 51948 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 24503 rows 5326 cols
[2024-05-20 20:19:42] [INFO ] Computed 72 invariants in 1290 ms
[2024-05-20 20:19:43] [INFO ] [Real]Absence check using 70 positive place invariants in 49 ms returned sat
[2024-05-20 20:19:43] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-20 20:19:59] [INFO ] After 16457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 20:19:59] [INFO ] [Nat]Absence check using 70 positive place invariants in 56 ms returned sat
[2024-05-20 20:19:59] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-20 20:20:13] [INFO ] After 13249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 20:20:13] [INFO ] State equation strengthened by 24215 read => feed constraints.
[2024-05-20 20:20:23] [INFO ] After 9493ms SMT Verify possible using 24215 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 20:20:24] [INFO ] After 10495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 20:20:24] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1382 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1382 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1423 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-20 20:20:26] [INFO ] Invariant cache hit.
[2024-05-20 20:20:31] [INFO ] Implicit Places using invariants in 4466 ms returned []
Implicit Place search using SMT only with invariants took 4467 ms to find 0 implicit places.
[2024-05-20 20:20:31] [INFO ] Invariant cache hit.
[2024-05-20 20:20:45] [INFO ] Dead Transitions using invariants and state equation in 13871 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19765 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 185 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2174 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-20 20:20:52] [INFO ] Computed 72 invariants in 4732 ms
[2024-05-20 20:20:53] [INFO ] Implicit Places using invariants in 5623 ms returned []
Implicit Place search using SMT only with invariants took 5624 ms to find 0 implicit places.
[2024-05-20 20:20:53] [INFO ] Invariant cache hit.
[2024-05-20 20:20:54] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8690 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-20 20:20:55] [INFO ] Invariant cache hit.
[2024-05-20 20:20:56] [INFO ] [Real]Absence check using 70 positive place invariants in 94 ms returned sat
[2024-05-20 20:20:57] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 176 ms returned sat
[2024-05-20 20:21:20] [INFO ] After 22871ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-20 20:21:20] [INFO ] State equation strengthened by 9730 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:21:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:21:20] [INFO ] After 25107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 12 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 3 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10633 place count 5327 transition count 24503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions removed 4972 transitions
Iterating global reduction 4 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 9140 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9140 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 62932 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62932 steps, saw 52043 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 24503 rows 5326 cols
[2024-05-20 20:21:34] [INFO ] Computed 72 invariants in 1337 ms
[2024-05-20 20:21:35] [INFO ] [Real]Absence check using 70 positive place invariants in 49 ms returned sat
[2024-05-20 20:21:35] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-20 20:21:48] [INFO ] After 13601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 20:21:48] [INFO ] [Nat]Absence check using 70 positive place invariants in 50 ms returned sat
[2024-05-20 20:21:48] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 64 ms returned sat
[2024-05-20 20:22:01] [INFO ] After 12646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 20:22:02] [INFO ] State equation strengthened by 24215 read => feed constraints.
[2024-05-20 20:22:10] [INFO ] After 8903ms SMT Verify possible using 24215 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 20:22:13] [INFO ] After 11231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 20:22:13] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1404 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1404 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1394 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-20 20:22:16] [INFO ] Invariant cache hit.
[2024-05-20 20:22:20] [INFO ] Implicit Places using invariants in 4222 ms returned []
Implicit Place search using SMT only with invariants took 4223 ms to find 0 implicit places.
[2024-05-20 20:22:20] [INFO ] Invariant cache hit.
[2024-05-20 20:22:33] [INFO ] Dead Transitions using invariants and state equation in 13244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18865 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Graph (trivial) has 24006 edges and 5326 vertex of which 4968 / 5326 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4966 places
Drop transitions removed 18906 transitions
Ensure Unique test removed 4958 transitions
Reduce isomorphic transitions removed 23864 transitions.
Graph (complete) has 1063 edges and 360 vertex of which 150 are kept as prefixes of interest. Removing 210 places using SCC suffix rule.1 ms
Discarding 210 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Drop transitions removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 150 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 211 place count 150 transition count 361
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 213 place count 149 transition count 361
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 347 place count 15 transition count 95
Iterating global reduction 1 with 134 rules applied. Total rules applied 481 place count 15 transition count 95
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 547 place count 15 transition count 29
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 549 place count 14 transition count 28
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 551 place count 13 transition count 27
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 555 place count 13 transition count 23
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 556 place count 13 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 557 place count 12 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 558 place count 11 transition count 21
Applied a total of 558 rules in 75 ms. Remains 11 /5326 variables (removed 5315) and now considering 21/24503 (removed 24482) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 21 rows 11 cols
[2024-05-20 20:22:33] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 20:22:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 20:22:33] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 20:22:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 20:22:33] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 20:22:33] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 20:22:33] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 7 factoid took 941 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 244 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 204 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 633 reset in 1511 ms.
Product exploration explored 100000 steps with 598 reset in 1552 ms.
Built C files in :
/tmp/ltsmin1046657621795752934
[2024-05-20 20:22:38] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1046657621795752934
Running compilation step : cd /tmp/ltsmin1046657621795752934;'/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/ltsmin1046657621795752934;'/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/ltsmin1046657621795752934;'/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 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2023 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-20 20:22:48] [INFO ] Computed 72 invariants in 4777 ms
[2024-05-20 20:22:49] [INFO ] Implicit Places using invariants in 5687 ms returned []
Implicit Place search using SMT only with invariants took 5688 ms to find 0 implicit places.
[2024-05-20 20:22:49] [INFO ] Invariant cache hit.
[2024-05-20 20:22:50] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8597 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Built C files in :
/tmp/ltsmin15003335346527780130
[2024-05-20 20:22:50] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15003335346527780130
Running compilation step : cd /tmp/ltsmin15003335346527780130;'/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/ltsmin15003335346527780130;'/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/ltsmin15003335346527780130;'/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 20:22:54] [INFO ] Flatten gal took : 565 ms
[2024-05-20 20:22:55] [INFO ] Flatten gal took : 558 ms
[2024-05-20 20:22:55] [INFO ] Time to serialize gal into /tmp/LTL6364211949791978436.gal : 93 ms
[2024-05-20 20:22:55] [INFO ] Time to serialize properties into /tmp/LTL10558360741112916849.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6364211949791978436.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4333367516418647049.hoa' '-atoms' '/tmp/LTL10558360741112916849.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10558360741112916849.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4333367516418647049.hoa
Detected timeout of ITS tools.
[2024-05-20 20:23:11] [INFO ] Flatten gal took : 528 ms
[2024-05-20 20:23:11] [INFO ] Flatten gal took : 546 ms
[2024-05-20 20:23:11] [INFO ] Time to serialize gal into /tmp/LTL1973248836368626883.gal : 83 ms
[2024-05-20 20:23:11] [INFO ] Time to serialize properties into /tmp/LTL4551473776785039325.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/LTL1973248836368626883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4551473776785039325.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("(Node36GiveAnswer17>=3)"))||(F(("(Node60ID2>=1)")||((X("(Node36GiveAnswer17<3)"))U((X(G("(Node36GiveAnswer17<3)")))||((X("(No...215
Formula 0 simplified : F(X!"(Node36GiveAnswer17>=3)" & G(!"(Node60ID2>=1)" & (X!"(Node36GiveAnswer17<3)" R (XF!"(Node36GiveAnswer17<3)" & (X!"(Node36GiveAn...198
Detected timeout of ITS tools.
[2024-05-20 20:23:27] [INFO ] Flatten gal took : 535 ms
[2024-05-20 20:23:27] [INFO ] Applying decomposition
[2024-05-20 20:23:27] [INFO ] Flatten gal took : 545 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/graph8042592062129310008.txt' '-o' '/tmp/graph8042592062129310008.bin' '-w' '/tmp/graph8042592062129310008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8042592062129310008.bin' '-l' '-1' '-v' '-w' '/tmp/graph8042592062129310008.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:23:28] [INFO ] Decomposing Gal with order
[2024-05-20 20:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:23:31] [INFO ] Removed a total of 14735 redundant transitions.
[2024-05-20 20:23:32] [INFO ] Flatten gal took : 1893 ms
[2024-05-20 20:23:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 19532 labels/synchronizations in 1781 ms.
[2024-05-20 20:23:34] [INFO ] Time to serialize gal into /tmp/LTL17312075737241429667.gal : 131 ms
[2024-05-20 20:23:34] [INFO ] Time to serialize properties into /tmp/LTL1778104832471194197.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/LTL17312075737241429667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1778104832471194197.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 : !((G((X("(i18.u70.Node36GiveAnswer17>=3)"))||(F(("(i62.u240.Node60ID2>=1)")||((X("(i18.u70.Node36GiveAnswer17<3)"))U((X(G("(i18.u70.No...265
Formula 0 simplified : F(X!"(i18.u70.Node36GiveAnswer17>=3)" & G(!"(i62.u240.Node60ID2>=1)" & (X!"(i18.u70.Node36GiveAnswer17<3)" R (XF!"(i18.u70.Node36Giv...248
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8251122050081622262
[2024-05-20 20:23:49] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8251122050081622262
Running compilation step : cd /tmp/ltsmin8251122050081622262;'/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/ltsmin8251122050081622262;'/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/ltsmin8251122050081622262;'/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-070-LTLCardinality-06 finished in 296981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(F(p2)))))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 10 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 5521 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-20 20:23:58] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-20 20:23:59] [INFO ] Computed 72 invariants in 1613 ms
[2024-05-20 20:24:01] [INFO ] Implicit Places using invariants in 3126 ms returned []
Implicit Place search using SMT only with invariants took 3127 ms to find 0 implicit places.
[2024-05-20 20:24:01] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-20 20:24:01] [INFO ] Invariant cache hit.
[2024-05-20 20:24:14] [INFO ] Dead Transitions using invariants and state equation in 13528 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22178 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s3502), p0:(AND (LEQ s3639 s4132) (LEQ 2 s1567)), p2:(LEQ s3639 s4132)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 355 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-07 finished in 22385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 8 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 6884 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-20 20:24:21] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-20 20:24:23] [INFO ] Computed 72 invariants in 1600 ms
[2024-05-20 20:24:24] [INFO ] Implicit Places using invariants in 2827 ms returned []
Implicit Place search using SMT only with invariants took 2828 ms to find 0 implicit places.
[2024-05-20 20:24:24] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-20 20:24:24] [INFO ] Invariant cache hit.
[2024-05-20 20:24:38] [INFO ] Dead Transitions using invariants and state equation in 13497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23211 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s761 s4125)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 338 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-09 finished in 23320 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((p0&&F(G(p1)))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3160 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-20 20:24:46] [INFO ] Computed 72 invariants in 4920 ms
[2024-05-20 20:24:47] [INFO ] Implicit Places using invariants in 5833 ms returned []
Implicit Place search using SMT only with invariants took 5834 ms to find 0 implicit places.
[2024-05-20 20:24:47] [INFO ] Invariant cache hit.
[2024-05-20 20:24:48] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9904 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s4178), p1:(GT s3615 s154)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-10 finished in 10200 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 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3202 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-20 20:24:51] [INFO ] Invariant cache hit.
[2024-05-20 20:24:52] [INFO ] Implicit Places using invariants in 1026 ms returned []
Implicit Place search using SMT only with invariants took 1027 ms to find 0 implicit places.
[2024-05-20 20:24:52] [INFO ] Invariant cache hit.
[2024-05-20 20:24:53] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5256 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-11 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:(LEQ s10230 s6922)], 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 23232 steps with 13 reset in 651 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-11 finished in 6111 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(p0))'
Support contains 1 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 14 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10640 place count 5323 transition count 24500
Applied a total of 10640 rules in 7673 ms. Remains 5323 /10643 variables (removed 5320) and now considering 24500/29820 (removed 5320) transitions.
[2024-05-20 20:25:02] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
// Phase 1: matrix 19808 rows 5323 cols
[2024-05-20 20:25:04] [INFO ] Computed 72 invariants in 1643 ms
[2024-05-20 20:25:05] [INFO ] Implicit Places using invariants in 2989 ms returned []
Implicit Place search using SMT only with invariants took 2991 ms to find 0 implicit places.
[2024-05-20 20:25:05] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-20 20:25:05] [INFO ] Invariant cache hit.
[2024-05-20 20:25:19] [INFO ] Dead Transitions using invariants and state equation in 13775 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/10643 places, 24500/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24444 ms. Remains : 5323/10643 places, 24500/29820 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 3 s3289)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 284 reset in 2245 ms.
Product exploration explored 100000 steps with 283 reset in 2080 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 54407 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54407 steps, saw 39027 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:25:27] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-20 20:25:27] [INFO ] Invariant cache hit.
[2024-05-20 20:25:27] [INFO ] [Real]Absence check using 70 positive place invariants in 51 ms returned sat
[2024-05-20 20:25:27] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-20 20:25:35] [INFO ] After 8020ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:25:35] [INFO ] State equation strengthened by 14628 read => feed constraints.
[2024-05-20 20:25:37] [INFO ] After 1992ms SMT Verify possible using 14628 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:25:37] [INFO ] After 10896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:25:38] [INFO ] [Nat]Absence check using 70 positive place invariants in 54 ms returned sat
[2024-05-20 20:25:38] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-20 20:25:46] [INFO ] After 8193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:25:56] [INFO ] After 9859ms SMT Verify possible using 14628 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:25:57] [INFO ] After 10604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 466 ms.
[2024-05-20 20:25:57] [INFO ] After 20031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5323 transition count 24499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5322 transition count 24499
Applied a total of 4972 rules in 6282 ms. Remains 5322 /5323 variables (removed 1) and now considering 24499/24500 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6282 ms. Remains : 5322/5323 places, 24499/24500 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 66626 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66626 steps, saw 52275 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:26:07] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2024-05-20 20:26:08] [INFO ] Computed 72 invariants in 1182 ms
[2024-05-20 20:26:09] [INFO ] [Real]Absence check using 70 positive place invariants in 50 ms returned sat
[2024-05-20 20:26:09] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-20 20:26:17] [INFO ] After 8636ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:26:18] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2024-05-20 20:26:24] [INFO ] After 6379ms SMT Verify possible using 24288 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:26:24] [INFO ] After 15869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:26:25] [INFO ] [Nat]Absence check using 70 positive place invariants in 52 ms returned sat
[2024-05-20 20:26:25] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-20 20:26:34] [INFO ] After 8952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:26:39] [INFO ] After 5784ms SMT Verify possible using 24288 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:26:40] [INFO ] After 6639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 631 ms.
[2024-05-20 20:26:41] [INFO ] After 16898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 2201 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2201 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 2287 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2024-05-20 20:26:45] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-20 20:26:45] [INFO ] Invariant cache hit.
[2024-05-20 20:26:50] [INFO ] Implicit Places using invariants in 4357 ms returned []
Implicit Place search using SMT only with invariants took 4358 ms to find 0 implicit places.
[2024-05-20 20:26:50] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-20 20:26:50] [INFO ] Invariant cache hit.
[2024-05-20 20:27:03] [INFO ] Dead Transitions using invariants and state equation in 13642 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20290 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1874 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-20 20:27:06] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
// Phase 1: matrix 19808 rows 5323 cols
[2024-05-20 20:27:07] [INFO ] Computed 72 invariants in 1612 ms
[2024-05-20 20:27:08] [INFO ] Implicit Places using invariants in 2843 ms returned []
Implicit Place search using SMT only with invariants took 2846 ms to find 0 implicit places.
[2024-05-20 20:27:08] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-20 20:27:08] [INFO ] Invariant cache hit.
[2024-05-20 20:27:21] [INFO ] Dead Transitions using invariants and state equation in 12281 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17002 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 54698 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54698 steps, saw 39068 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:27:24] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-20 20:27:24] [INFO ] Invariant cache hit.
[2024-05-20 20:27:25] [INFO ] [Real]Absence check using 70 positive place invariants in 55 ms returned sat
[2024-05-20 20:27:25] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-20 20:27:32] [INFO ] After 7365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:27:32] [INFO ] State equation strengthened by 14628 read => feed constraints.
[2024-05-20 20:27:34] [INFO ] After 1764ms SMT Verify possible using 14628 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:27:34] [INFO ] After 9918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:27:35] [INFO ] [Nat]Absence check using 70 positive place invariants in 54 ms returned sat
[2024-05-20 20:27:35] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 74 ms returned sat
[2024-05-20 20:27:42] [INFO ] After 7470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:27:52] [INFO ] After 9615ms SMT Verify possible using 14628 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:27:53] [INFO ] After 10369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 459 ms.
[2024-05-20 20:27:53] [INFO ] After 18969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5323 transition count 24499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5322 transition count 24499
Applied a total of 4972 rules in 6350 ms. Remains 5322 /5323 variables (removed 1) and now considering 24499/24500 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6350 ms. Remains : 5322/5323 places, 24499/24500 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 67306 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67306 steps, saw 52373 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:28:03] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2024-05-20 20:28:04] [INFO ] Computed 72 invariants in 1213 ms
[2024-05-20 20:28:04] [INFO ] [Real]Absence check using 70 positive place invariants in 51 ms returned sat
[2024-05-20 20:28:04] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 75 ms returned sat
[2024-05-20 20:28:13] [INFO ] After 8835ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:28:14] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2024-05-20 20:28:20] [INFO ] After 6191ms SMT Verify possible using 24288 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:28:20] [INFO ] After 15896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:28:20] [INFO ] [Nat]Absence check using 70 positive place invariants in 48 ms returned sat
[2024-05-20 20:28:20] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-20 20:28:29] [INFO ] After 8813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:28:35] [INFO ] After 5509ms SMT Verify possible using 24288 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:28:36] [INFO ] After 6364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 636 ms.
[2024-05-20 20:28:36] [INFO ] After 16458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 2139 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2139 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 2234 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2024-05-20 20:28:41] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-20 20:28:41] [INFO ] Invariant cache hit.
[2024-05-20 20:28:45] [INFO ] Implicit Places using invariants in 4297 ms returned []
Implicit Place search using SMT only with invariants took 4298 ms to find 0 implicit places.
[2024-05-20 20:28:45] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-20 20:28:45] [INFO ] Invariant cache hit.
[2024-05-20 20:28:58] [INFO ] Dead Transitions using invariants and state equation in 13312 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19846 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Graph (trivial) has 24075 edges and 5322 vertex of which 5038 / 5322 are part of one of the 2 SCC in 4 ms
Free SCC test removed 5036 places
Drop transitions removed 19247 transitions
Ensure Unique test removed 4963 transitions
Reduce isomorphic transitions removed 24210 transitions.
Graph (complete) has 711 edges and 286 vertex of which 75 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.0 ms
Discarding 211 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 141 transitions
Reduce isomorphic transitions removed 141 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 142 rules applied. Total rules applied 144 place count 75 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 145 place count 74 transition count 78
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 213 place count 6 transition count 10
Iterating global reduction 2 with 68 rules applied. Total rules applied 281 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 4 transition count 5
Applied a total of 287 rules in 56 ms. Remains 4 /5322 variables (removed 5318) and now considering 5/24499 (removed 24494) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-20 20:28:58] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 20:28:58] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:28:58] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:28:58] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 20:28:58] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 420 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 283 reset in 1990 ms.
Product exploration explored 100000 steps with 283 reset in 2065 ms.
Built C files in :
/tmp/ltsmin6340243595424849075
[2024-05-20 20:29:03] [INFO ] Too many transitions (24500) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:29:03] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6340243595424849075
Running compilation step : cd /tmp/ltsmin6340243595424849075;'/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/ltsmin6340243595424849075;'/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/ltsmin6340243595424849075;'/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 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1966 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-20 20:29:08] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
// Phase 1: matrix 19808 rows 5323 cols
[2024-05-20 20:29:10] [INFO ] Computed 72 invariants in 1625 ms
[2024-05-20 20:29:11] [INFO ] Implicit Places using invariants in 2834 ms returned []
Implicit Place search using SMT only with invariants took 2848 ms to find 0 implicit places.
[2024-05-20 20:29:11] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-20 20:29:11] [INFO ] Invariant cache hit.
[2024-05-20 20:29:24] [INFO ] Dead Transitions using invariants and state equation in 13440 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18254 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Built C files in :
/tmp/ltsmin6357112683241913974
[2024-05-20 20:29:24] [INFO ] Too many transitions (24500) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:29:25] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6357112683241913974
Running compilation step : cd /tmp/ltsmin6357112683241913974;'/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/ltsmin6357112683241913974;'/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/ltsmin6357112683241913974;'/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 20:29:28] [INFO ] Flatten gal took : 389 ms
[2024-05-20 20:29:29] [INFO ] Flatten gal took : 409 ms
[2024-05-20 20:29:29] [INFO ] Time to serialize gal into /tmp/LTL7965452956865467694.gal : 72 ms
[2024-05-20 20:29:29] [INFO ] Time to serialize properties into /tmp/LTL14533989951090052334.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7965452956865467694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10365424174580738838.hoa' '-atoms' '/tmp/LTL14533989951090052334.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/LTL14533989951090052334.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10365424174580738838.hoa
Detected timeout of ITS tools.
[2024-05-20 20:29:44] [INFO ] Flatten gal took : 384 ms
[2024-05-20 20:29:45] [INFO ] Flatten gal took : 406 ms
[2024-05-20 20:29:45] [INFO ] Time to serialize gal into /tmp/LTL6628813832422093102.gal : 75 ms
[2024-05-20 20:29:45] [INFO ] Time to serialize properties into /tmp/LTL1498001334676894248.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/LTL6628813832422093102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1498001334676894248.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G("(Node40requestsent67<3)")))
Formula 0 simplified : F!"(Node40requestsent67<3)"
Detected timeout of ITS tools.
[2024-05-20 20:30:00] [INFO ] Flatten gal took : 406 ms
[2024-05-20 20:30:00] [INFO ] Applying decomposition
[2024-05-20 20:30:01] [INFO ] Flatten gal took : 424 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/graph6042668753022984054.txt' '-o' '/tmp/graph6042668753022984054.bin' '-w' '/tmp/graph6042668753022984054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6042668753022984054.bin' '-l' '-1' '-v' '-w' '/tmp/graph6042668753022984054.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:30:02] [INFO ] Decomposing Gal with order
[2024-05-20 20:30:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:30:04] [INFO ] Removed a total of 19424 redundant transitions.
[2024-05-20 20:30:05] [INFO ] Flatten gal took : 2620 ms
[2024-05-20 20:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 14353 labels/synchronizations in 3665 ms.
[2024-05-20 20:30:09] [INFO ] Time to serialize gal into /tmp/LTL13825826211710267753.gal : 95 ms
[2024-05-20 20:30:09] [INFO ] Time to serialize properties into /tmp/LTL4122626745324481509.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/LTL13825826211710267753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4122626745324481509.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 : !((G("(u41.Node40requestsent67<3)")))
Formula 0 simplified : F!"(u41.Node40requestsent67<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin530179294026291447
[2024-05-20 20:30:24] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin530179294026291447
Running compilation step : cd /tmp/ltsmin530179294026291447;'/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/ltsmin530179294026291447;'/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/ltsmin530179294026291447;'/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-070-LTLCardinality-12 finished in 332817 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(G(p0))))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3242 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-20 20:30:35] [INFO ] Computed 72 invariants in 4664 ms
[2024-05-20 20:30:36] [INFO ] Implicit Places using invariants in 5567 ms returned []
Implicit Place search using SMT only with invariants took 5575 ms to find 0 implicit places.
[2024-05-20 20:30:36] [INFO ] Invariant cache hit.
[2024-05-20 20:30:37] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9740 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s2915 s1861)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-13 finished in 9919 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(p1)))&&F(p2)))'
Support contains 6 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3043 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-20 20:30:40] [INFO ] Invariant cache hit.
[2024-05-20 20:30:41] [INFO ] Implicit Places using invariants in 909 ms returned []
Implicit Place search using SMT only with invariants took 910 ms to find 0 implicit places.
[2024-05-20 20:30:41] [INFO ] Invariant cache hit.
[2024-05-20 20:30:42] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4848 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s3655 s10162), p0:(GT s10273 s7131), p1:(GT s1783 s4915)], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 1637 steps with 0 reset in 27 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-14 finished in 5117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4826 Post agglomeration using F-continuation condition.Transition count delta: 4826
Deduced a syphon composed of 4826 places in 10 ms
Reduce places removed 4826 places and 0 transitions.
Iterating global reduction 2 with 9652 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Applied a total of 10632 rules in 6810 ms. Remains 5327 /10643 variables (removed 5316) and now considering 24504/29820 (removed 5316) transitions.
[2024-05-20 20:30:49] [INFO ] Flow matrix only has 19816 transitions (discarded 4688 similar events)
// Phase 1: matrix 19816 rows 5327 cols
[2024-05-20 20:30:51] [INFO ] Computed 72 invariants in 1623 ms
[2024-05-20 20:30:52] [INFO ] Implicit Places using invariants in 2869 ms returned []
Implicit Place search using SMT only with invariants took 2870 ms to find 0 implicit places.
[2024-05-20 20:30:52] [INFO ] Flow matrix only has 19816 transitions (discarded 4688 similar events)
[2024-05-20 20:30:52] [INFO ] Invariant cache hit.
[2024-05-20 20:31:05] [INFO ] Dead Transitions using invariants and state equation in 13562 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5327/10643 places, 24504/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23245 ms. Remains : 5327/10643 places, 24504/29820 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 2 s3375) (LEQ s3071 s5171)), p1:(LEQ 1 s3339)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 318 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-15 finished in 23423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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)||F((p1||(X(!p0) U ((X(!p0)&&G(p2))||X(G(!p0)))))))))'
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(p0))'
[2024-05-20 20:31:06] [INFO ] Flatten gal took : 516 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3306095796073769927
[2024-05-20 20:31:07] [INFO ] Too many transitions (29820) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:31:07] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3306095796073769927
Running compilation step : cd /tmp/ltsmin3306095796073769927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 20:31:07] [INFO ] Applying decomposition
[2024-05-20 20:31:07] [INFO ] Flatten gal took : 553 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/graph6397861429586948766.txt' '-o' '/tmp/graph6397861429586948766.bin' '-w' '/tmp/graph6397861429586948766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6397861429586948766.bin' '-l' '-1' '-v' '-w' '/tmp/graph6397861429586948766.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:31:08] [INFO ] Decomposing Gal with order
[2024-05-20 20:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:31:11] [INFO ] Removed a total of 14744 redundant transitions.
[2024-05-20 20:31:12] [INFO ] Flatten gal took : 1863 ms
[2024-05-20 20:31:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 9516 labels/synchronizations in 1735 ms.
[2024-05-20 20:31:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality10942482822582014941.gal : 101 ms
[2024-05-20 20:31:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality8799461049427735428.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/LTLCardinality10942482822582014941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8799461049427735428.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 4 LTL properties
Checking formula 0 : !((G(F(("((gu280.Node47GiveAnswer5<=gu280.Node3requestsent25)&&((gi0.gi52.gu251.Node52GiveAnswer62<2)||(gi0.gi52.gu251.Node52GiveAnswe...259
Formula 0 simplified : FG(!"((gu280.Node47GiveAnswer5<=gu280.Node3requestsent25)&&((gi0.gi52.gu251.Node52GiveAnswer62<2)||(gi0.gi52.gu251.Node52GiveAnswer6...254
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/ltsmin3306095796073769927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3306095796073769927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 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)
ITS-tools command line returned an error code 137
[2024-05-20 20:46:21] [INFO ] Flatten gal took : 675 ms
[2024-05-20 20:46:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality9778174396299976270.gal : 131 ms
[2024-05-20 20:46:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality12005755939033499322.ltl : 14 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/LTLCardinality9778174396299976270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12005755939033499322.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 4 LTL properties
Checking formula 0 : !((G(F(("((Node47GiveAnswer5<=Node3requestsent25)&&((Node52GiveAnswer62<2)||(Node52GiveAnswer62>=2)))")||(("(Node50requestsent52>=3)")...188
Formula 0 simplified : FG(!"((Node47GiveAnswer5<=Node3requestsent25)&&((Node52GiveAnswer62<2)||(Node52GiveAnswer62>=2)))" & (!"(Node50requestsent52>=3)" R ...183
ITS-tools command line returned an error code 137
[2024-05-20 21:01:54] [INFO ] Flatten gal took : 2238 ms
[2024-05-20 21:02:08] [INFO ] Input system was already deterministic with 29820 transitions.
[2024-05-20 21:02:09] [INFO ] Transformed 10643 places.
[2024-05-20 21:02:09] [INFO ] Transformed 29820 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../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 21:02:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality14118629818918675917.gal : 171 ms
[2024-05-20 21:02:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality14503069744383650613.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14118629818918675917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14503069744383650613.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...344
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((Node47GiveAnswer5<=Node3requestsent25)&&((Node52GiveAnswer62<2)||(Node52GiveAnswer62>=2)))")||(("(Node50requestsent52>=3)")...188
Formula 0 simplified : FG(!"((Node47GiveAnswer5<=Node3requestsent25)&&((Node52GiveAnswer62<2)||(Node52GiveAnswer62>=2)))" & (!"(Node50requestsent52>=3)" R ...183
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7617940 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12867932 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-070"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-070, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521500092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-070.tgz
mv CANInsertWithFailure-PT-070 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;