About the Execution of LTSMin+red for CANInsertWithFailure-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2419.939 | 928635.00 | 1064783.00 | 264.70 | FF?FFT?TFF?FF?T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100731.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100731
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.8M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678661585582
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:53:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 22:53:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:53:07] [INFO ] Load time of PNML (sax parser for PT used): 480 ms
[2023-03-12 22:53:07] [INFO ] Transformed 3684 places.
[2023-03-12 22:53:07] [INFO ] Transformed 9840 transitions.
[2023-03-12 22:53:07] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 603 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 442 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:53:09] [INFO ] Computed 42 place invariants in 657 ms
[2023-03-12 22:53:10] [INFO ] Implicit Places using invariants in 1708 ms returned []
[2023-03-12 22:53:10] [INFO ] Invariant cache hit.
[2023-03-12 22:53:11] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 3315 ms to find 0 implicit places.
[2023-03-12 22:53:11] [INFO ] Invariant cache hit.
[2023-03-12 22:53:16] [INFO ] Dead Transitions using invariants and state equation in 4785 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8552 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 48 out of 3683 places after structural reductions.
[2023-03-12 22:53:17] [INFO ] Flatten gal took : 432 ms
[2023-03-12 22:53:17] [INFO ] Flatten gal took : 282 ms
[2023-03-12 22:53:18] [INFO ] Input system was already deterministic with 9840 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 30) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) 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 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2023-03-12 22:53:18] [INFO ] Invariant cache hit.
[2023-03-12 22:53:20] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2023-03-12 22:53:20] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 65 ms returned sat
[2023-03-12 22:53:20] [INFO ] After 1926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-12 22:53:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2023-03-12 22:53:22] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 46 ms returned sat
[2023-03-12 22:53:34] [INFO ] After 11222ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :20
[2023-03-12 22:53:34] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:53:45] [INFO ] After 11375ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2023-03-12 22:53:45] [INFO ] After 11375ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 22:53:45] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 2 properties in 1103 ms.
Support contains 31 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 3683 transition count 9566
Reduce places removed 274 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 277 rules applied. Total rules applied 551 place count 3409 transition count 9563
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 554 place count 3406 transition count 9563
Performed 1471 Post agglomeration using F-continuation condition.Transition count delta: 1471
Deduced a syphon composed of 1471 places in 4 ms
Reduce places removed 1471 places and 0 transitions.
Iterating global reduction 3 with 2942 rules applied. Total rules applied 3496 place count 1935 transition count 8092
Drop transitions removed 1396 transitions
Redundant transition composition rules discarded 1396 transitions
Iterating global reduction 3 with 1396 rules applied. Total rules applied 4892 place count 1935 transition count 6696
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 4895 place count 1935 transition count 6693
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4898 place count 1932 transition count 6693
Partial Free-agglomeration rule applied 1701 times.
Drop transitions removed 1701 transitions
Iterating global reduction 4 with 1701 rules applied. Total rules applied 6599 place count 1932 transition count 6693
Applied a total of 6599 rules in 1790 ms. Remains 1932 /3683 variables (removed 1751) and now considering 6693/9840 (removed 3147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1791 ms. Remains : 1932/3683 places, 6693/9840 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 6693 rows 1932 cols
[2023-03-12 22:53:49] [INFO ] Computed 42 place invariants in 166 ms
[2023-03-12 22:53:50] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-12 22:53:50] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 22:53:50] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 22:53:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-12 22:53:50] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-12 22:53:55] [INFO ] After 4411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-12 22:53:55] [INFO ] State equation strengthened by 6328 read => feed constraints.
[2023-03-12 22:54:03] [INFO ] After 7451ms SMT Verify possible using 6328 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-12 22:54:09] [INFO ] After 13929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 4434 ms.
[2023-03-12 22:54:14] [INFO ] After 23580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 308 ms.
Support contains 22 out of 1932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1932/1932 places, 6693/6693 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1929 transition count 6690
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 1929 transition count 6690
Applied a total of 11 rules in 550 ms. Remains 1929 /1932 variables (removed 3) and now considering 6690/6693 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 1929/1932 places, 6690/6693 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 85064 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85064 steps, saw 29145 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 6690 rows 1929 cols
[2023-03-12 22:54:18] [INFO ] Computed 42 place invariants in 138 ms
[2023-03-12 22:54:19] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 22:54:19] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 22:54:19] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 22:54:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2023-03-12 22:54:20] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 37 ms returned sat
[2023-03-12 22:54:25] [INFO ] After 4710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-12 22:54:25] [INFO ] State equation strengthened by 6339 read => feed constraints.
[2023-03-12 22:54:31] [INFO ] After 6223ms SMT Verify possible using 6339 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-12 22:54:37] [INFO ] After 12295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 3889 ms.
[2023-03-12 22:54:41] [INFO ] After 21996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 477 ms.
Support contains 22 out of 1929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1929/1929 places, 6690/6690 transitions.
Applied a total of 0 rules in 202 ms. Remains 1929 /1929 variables (removed 0) and now considering 6690/6690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 1929/1929 places, 6690/6690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1929/1929 places, 6690/6690 transitions.
Applied a total of 0 rules in 169 ms. Remains 1929 /1929 variables (removed 0) and now considering 6690/6690 (removed 0) transitions.
[2023-03-12 22:54:42] [INFO ] Invariant cache hit.
[2023-03-12 22:54:44] [INFO ] Implicit Places using invariants in 1800 ms returned []
[2023-03-12 22:54:44] [INFO ] Invariant cache hit.
[2023-03-12 22:54:45] [INFO ] State equation strengthened by 6339 read => feed constraints.
[2023-03-12 22:54:45] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 3392 ms to find 0 implicit places.
[2023-03-12 22:54:46] [INFO ] Redundant transitions in 824 ms returned []
[2023-03-12 22:54:46] [INFO ] Invariant cache hit.
[2023-03-12 22:54:49] [INFO ] Dead Transitions using invariants and state equation in 2797 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7201 ms. Remains : 1929/1929 places, 6690/6690 transitions.
Graph (trivial) has 6182 edges and 1929 vertex of which 1663 / 1929 are part of one of the 2 SCC in 10 ms
Free SCC test removed 1661 places
Drop transitions removed 4601 transitions
Ensure Unique test removed 1584 transitions
Reduce isomorphic transitions removed 6185 transitions.
Graph (complete) has 787 edges and 268 vertex of which 149 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.1 ms
Discarding 119 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 149 transition count 313
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 230 place count 75 transition count 201
Iterating global reduction 1 with 74 rules applied. Total rules applied 304 place count 75 transition count 201
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 341 place count 38 transition count 127
Iterating global reduction 1 with 37 rules applied. Total rules applied 378 place count 38 transition count 127
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 415 place count 38 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 419 place count 36 transition count 89
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 427 place count 36 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 428 place count 35 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 35 transition count 80
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 431 place count 34 transition count 79
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 433 place count 33 transition count 78
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 436 place count 33 transition count 75
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 441 place count 30 transition count 73
Applied a total of 441 rules in 73 ms. Remains 30 /1929 variables (removed 1899) and now considering 73/6690 (removed 6617) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 73 rows 30 cols
[2023-03-12 22:54:49] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 22:54:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 22:54:49] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-12 22:54:49] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-12 22:54:49] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(X(p1)&&(!p0||F(!p1)))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 253 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:54:50] [INFO ] Computed 42 place invariants in 521 ms
[2023-03-12 22:54:51] [INFO ] Implicit Places using invariants in 1335 ms returned []
[2023-03-12 22:54:51] [INFO ] Invariant cache hit.
[2023-03-12 22:54:53] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
[2023-03-12 22:54:53] [INFO ] Invariant cache hit.
[2023-03-12 22:54:58] [INFO ] Dead Transitions using invariants and state equation in 5468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8674 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0)), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 s3630), p1:(LEQ 1 s999)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-00 finished in 9137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||(p2&&X(X(p3)))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 282 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:54:59] [INFO ] Invariant cache hit.
[2023-03-12 22:55:00] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-12 22:55:00] [INFO ] Invariant cache hit.
[2023-03-12 22:55:03] [INFO ] Implicit Places using invariants and state equation in 2955 ms returned []
Implicit Place search using SMT with State Equation took 3727 ms to find 0 implicit places.
[2023-03-12 22:55:03] [INFO ] Invariant cache hit.
[2023-03-12 22:55:07] [INFO ] Dead Transitions using invariants and state equation in 4463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8475 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s2891 s2502) (LEQ s3381 s3509)), p2:(LEQ s3381 s3509), p0:(LEQ s2891 s2502), p3:(GT 3 s1655)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33372 reset in 2626 ms.
Product exploration explored 100000 steps with 33580 reset in 2263 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), true, (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 526 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:55:13] [INFO ] Invariant cache hit.
[2023-03-12 22:55:14] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2023-03-12 22:55:14] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 60 ms returned sat
[2023-03-12 22:55:18] [INFO ] After 4367ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 22:55:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:55:19] [INFO ] After 1053ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:55:19] [INFO ] After 5986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:55:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 59 ms returned sat
[2023-03-12 22:55:20] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-12 22:55:24] [INFO ] After 4260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:55:29] [INFO ] After 4616ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:55:29] [INFO ] After 5136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-12 22:55:30] [INFO ] After 10338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 2 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 2 with 3120 rules applied. Total rules applied 3680 place count 1843 transition count 8000
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5162 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5163 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5164 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6804 place count 1842 transition count 6517
Applied a total of 6804 rules in 1452 ms. Remains 1842 /3683 variables (removed 1841) and now considering 6517/9840 (removed 3323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1454 ms. Remains : 1842/3683 places, 6517/9840 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 117003 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 117003 steps, saw 32775 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2023-03-12 22:55:34] [INFO ] Computed 42 place invariants in 246 ms
[2023-03-12 22:55:35] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 22:55:35] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 22:55:37] [INFO ] After 1924ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 22:55:37] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 22:55:38] [INFO ] After 1523ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:55:38] [INFO ] After 3799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:55:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 22:55:39] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-12 22:55:40] [INFO ] After 1918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:55:42] [INFO ] After 1462ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:55:42] [INFO ] After 1823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-12 22:55:43] [INFO ] After 4326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 216 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 158 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2023-03-12 22:55:43] [INFO ] Invariant cache hit.
[2023-03-12 22:55:45] [INFO ] Implicit Places using invariants in 1762 ms returned []
[2023-03-12 22:55:45] [INFO ] Invariant cache hit.
[2023-03-12 22:55:45] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 22:55:56] [INFO ] Implicit Places using invariants and state equation in 11545 ms returned []
Implicit Place search using SMT with State Equation took 13309 ms to find 0 implicit places.
[2023-03-12 22:55:57] [INFO ] Redundant transitions in 562 ms returned []
[2023-03-12 22:55:57] [INFO ] Invariant cache hit.
[2023-03-12 22:56:00] [INFO ] Dead Transitions using invariants and state equation in 2959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17004 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6274 edges and 1842 vertex of which 1678 / 1842 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 4 transition count 5
Applied a total of 167 rules in 13 ms. Remains 4 /1842 variables (removed 1838) and now considering 5/6517 (removed 6512) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-12 22:56:00] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 22:56:00] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:56:00] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:56:00] [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 1 ms.
[2023-03-12 22:56:00] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0 p3), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), true, (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p3))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2)))
Knowledge based reduction with 11 factoid took 164 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-01 finished in 61357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||F(p1))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 223 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:56:01] [INFO ] Computed 42 place invariants in 531 ms
[2023-03-12 22:56:02] [INFO ] Implicit Places using invariants in 1318 ms returned []
[2023-03-12 22:56:02] [INFO ] Invariant cache hit.
[2023-03-12 22:56:05] [INFO ] Implicit Places using invariants and state equation in 3061 ms returned []
Implicit Place search using SMT with State Equation took 4382 ms to find 0 implicit places.
[2023-03-12 22:56:05] [INFO ] Invariant cache hit.
[2023-03-12 22:56:10] [INFO ] Dead Transitions using invariants and state equation in 4903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9514 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(GT 2 s3156), p0:(LEQ 2 s791)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1938 ms.
Product exploration explored 100000 steps with 25000 reset in 1889 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 65267 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65267 steps, saw 46195 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 22:56:17] [INFO ] Invariant cache hit.
[2023-03-12 22:56:18] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2023-03-12 22:56:18] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-12 22:56:23] [INFO ] After 5012ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 22:56:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:56:25] [INFO ] After 1408ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:56:25] [INFO ] After 7190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:56:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2023-03-12 22:56:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-12 22:56:31] [INFO ] After 5448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:56:45] [INFO ] After 13966ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:56:46] [INFO ] After 15657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 921 ms.
[2023-03-12 22:56:47] [INFO ] After 22752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 4 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6801 place count 1843 transition count 6519
Applied a total of 6801 rules in 1433 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1434 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 106467 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106467 steps, saw 28310 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-12 22:56:52] [INFO ] Computed 42 place invariants in 157 ms
[2023-03-12 22:56:52] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 22:56:52] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 22:56:55] [INFO ] After 2283ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 22:56:55] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 22:56:56] [INFO ] After 1227ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:56:56] [INFO ] After 3947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:56:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 22:56:56] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-12 22:56:59] [INFO ] After 2480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:57:01] [INFO ] After 2032ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:57:02] [INFO ] After 3050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 907 ms.
[2023-03-12 22:57:03] [INFO ] After 6836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 266 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 236 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-12 22:57:03] [INFO ] Invariant cache hit.
[2023-03-12 22:57:05] [INFO ] Implicit Places using invariants in 1946 ms returned []
[2023-03-12 22:57:05] [INFO ] Invariant cache hit.
[2023-03-12 22:57:06] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 22:57:17] [INFO ] Implicit Places using invariants and state equation in 11784 ms returned []
Implicit Place search using SMT with State Equation took 13735 ms to find 0 implicit places.
[2023-03-12 22:57:18] [INFO ] Redundant transitions in 453 ms returned []
[2023-03-12 22:57:18] [INFO ] Invariant cache hit.
[2023-03-12 22:57:21] [INFO ] Dead Transitions using invariants and state equation in 2902 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17341 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6272 edges and 1843 vertex of which 1678 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4715 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6347 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 5 transition count 8
Applied a total of 167 rules in 13 ms. Remains 5 /1843 variables (removed 1838) and now considering 8/6519 (removed 6511) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 22:57:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 22:57:21] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:57:21] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:57:21] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 22:57:21] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 262 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:57:22] [INFO ] Computed 42 place invariants in 524 ms
[2023-03-12 22:57:23] [INFO ] Implicit Places using invariants in 1507 ms returned []
[2023-03-12 22:57:23] [INFO ] Invariant cache hit.
[2023-03-12 22:57:25] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 3558 ms to find 0 implicit places.
[2023-03-12 22:57:25] [INFO ] Invariant cache hit.
[2023-03-12 22:57:30] [INFO ] Dead Transitions using invariants and state equation in 5274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9096 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 72495 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72495 steps, saw 47854 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 22:57:34] [INFO ] Invariant cache hit.
[2023-03-12 22:57:34] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2023-03-12 22:57:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-12 22:57:39] [INFO ] After 4906ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 22:57:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:57:41] [INFO ] After 1568ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:57:41] [INFO ] After 7153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:57:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2023-03-12 22:57:42] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 42 ms returned sat
[2023-03-12 22:57:47] [INFO ] After 5561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:58:01] [INFO ] After 13980ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:58:03] [INFO ] After 15570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-12 22:58:04] [INFO ] After 22772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6801 place count 1843 transition count 6519
Applied a total of 6801 rules in 1323 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1324 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 107575 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107575 steps, saw 28433 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-12 22:58:09] [INFO ] Computed 42 place invariants in 230 ms
[2023-03-12 22:58:09] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 22:58:09] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-12 22:58:11] [INFO ] After 2164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 22:58:11] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 22:58:12] [INFO ] After 1114ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:58:12] [INFO ] After 3787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:58:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 22:58:13] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-12 22:58:16] [INFO ] After 2668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:58:18] [INFO ] After 2571ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:58:19] [INFO ] After 3622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 911 ms.
[2023-03-12 22:58:20] [INFO ] After 7661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 2 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 246 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 216 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-12 22:58:21] [INFO ] Invariant cache hit.
[2023-03-12 22:58:23] [INFO ] Implicit Places using invariants in 2191 ms returned []
[2023-03-12 22:58:23] [INFO ] Invariant cache hit.
[2023-03-12 22:58:24] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 22:58:35] [INFO ] Implicit Places using invariants and state equation in 11710 ms returned []
Implicit Place search using SMT with State Equation took 13906 ms to find 0 implicit places.
[2023-03-12 22:58:35] [INFO ] Redundant transitions in 612 ms returned []
[2023-03-12 22:58:35] [INFO ] Invariant cache hit.
[2023-03-12 22:58:38] [INFO ] Dead Transitions using invariants and state equation in 2823 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17567 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6272 edges and 1843 vertex of which 1678 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4715 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6347 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 5 transition count 8
Applied a total of 167 rules in 13 ms. Remains 5 /1843 variables (removed 1838) and now considering 8/6519 (removed 6511) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 22:58:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:58:38] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:58:38] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:58:38] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 22:58:38] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 1764 ms.
Product exploration explored 100000 steps with 25000 reset in 1777 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 200 place count 3683 transition count 9840
Deduced a syphon composed of 240 places in 3 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 240 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 320 place count 3603 transition count 9760
Deduced a syphon composed of 160 places in 3 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 400 place count 3603 transition count 9760
Performed 1599 Post agglomeration using F-continuation condition.Transition count delta: -3038
Deduced a syphon composed of 1759 places in 4 ms
Iterating global reduction 1 with 1599 rules applied. Total rules applied 1999 place count 3603 transition count 12798
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2159 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 2319 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 3 ms
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 1 with 1481 rules applied. Total rules applied 3800 place count 3443 transition count 11157
Deduced a syphon composed of 1599 places in 2 ms
Applied a total of 3800 rules in 2347 ms. Remains 3443 /3683 variables (removed 240) and now considering 11157/9840 (removed -1317) transitions.
// Phase 1: matrix 11157 rows 3443 cols
[2023-03-12 22:58:45] [INFO ] Computed 42 place invariants in 423 ms
[2023-03-12 22:58:51] [INFO ] Dead Transitions using invariants and state equation in 5932 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3443/3683 places, 11157/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8282 ms. Remains : 3443/3683 places, 11157/9840 transitions.
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 248 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:58:51] [INFO ] Computed 42 place invariants in 406 ms
[2023-03-12 22:58:53] [INFO ] Implicit Places using invariants in 2310 ms returned []
[2023-03-12 22:58:53] [INFO ] Invariant cache hit.
[2023-03-12 22:58:55] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 4178 ms to find 0 implicit places.
[2023-03-12 22:58:55] [INFO ] Invariant cache hit.
[2023-03-12 22:59:00] [INFO ] Dead Transitions using invariants and state equation in 4468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8896 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-02 finished in 180127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G(p1))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 245 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:59:00] [INFO ] Invariant cache hit.
[2023-03-12 22:59:01] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-12 22:59:01] [INFO ] Invariant cache hit.
[2023-03-12 22:59:04] [INFO ] Implicit Places using invariants and state equation in 3247 ms returned []
Implicit Place search using SMT with State Equation took 4022 ms to find 0 implicit places.
[2023-03-12 22:59:04] [INFO ] Invariant cache hit.
[2023-03-12 22:59:09] [INFO ] Dead Transitions using invariants and state equation in 4567 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8843 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-03 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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GT 3 s1299), p1:(LEQ 2 s702)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-03 finished in 9026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 294 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:59:09] [INFO ] Invariant cache hit.
[2023-03-12 22:59:10] [INFO ] Implicit Places using invariants in 810 ms returned []
[2023-03-12 22:59:10] [INFO ] Invariant cache hit.
[2023-03-12 22:59:13] [INFO ] Implicit Places using invariants and state equation in 3056 ms returned []
Implicit Place search using SMT with State Equation took 3867 ms to find 0 implicit places.
[2023-03-12 22:59:13] [INFO ] Invariant cache hit.
[2023-03-12 22:59:18] [INFO ] Dead Transitions using invariants and state equation in 4964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9126 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s2157 s3372), p0:(LEQ s692 s2695)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3463 ms.
Product exploration explored 100000 steps with 50000 reset in 3427 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-05 finished in 16400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 265 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:59:26] [INFO ] Invariant cache hit.
[2023-03-12 22:59:27] [INFO ] Implicit Places using invariants in 809 ms returned []
[2023-03-12 22:59:27] [INFO ] Invariant cache hit.
[2023-03-12 22:59:30] [INFO ] Implicit Places using invariants and state equation in 3075 ms returned []
Implicit Place search using SMT with State Equation took 3886 ms to find 0 implicit places.
[2023-03-12 22:59:30] [INFO ] Invariant cache hit.
[2023-03-12 22:59:34] [INFO ] Dead Transitions using invariants and state equation in 4604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8758 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 2 s1932)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2024 ms.
Product exploration explored 100000 steps with 25000 reset in 2041 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70217 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70217 steps, saw 47352 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:59:42] [INFO ] Invariant cache hit.
[2023-03-12 22:59:42] [INFO ] [Real]Absence check using 40 positive place invariants in 47 ms returned sat
[2023-03-12 22:59:43] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-12 22:59:47] [INFO ] After 4115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 22:59:47] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:59:48] [INFO ] After 878ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:59:48] [INFO ] After 5585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:59:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2023-03-12 22:59:48] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 53 ms returned sat
[2023-03-12 22:59:53] [INFO ] After 4492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:00:02] [INFO ] After 9247ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-12 23:00:02] [INFO ] After 14358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 3 with 1641 rules applied. Total rules applied 6802 place count 1843 transition count 6519
Applied a total of 6802 rules in 1448 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 117000 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 117000 steps, saw 32773 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-12 23:00:07] [INFO ] Computed 42 place invariants in 246 ms
[2023-03-12 23:00:07] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-12 23:00:07] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:00:09] [INFO ] After 1370ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:00:09] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 23:00:09] [INFO ] After 658ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:00:09] [INFO ] After 2421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:00:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2023-03-12 23:00:09] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 23:00:11] [INFO ] After 1539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:00:12] [INFO ] After 1208ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:00:13] [INFO ] After 1550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-12 23:00:13] [INFO ] After 3615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 255 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 245 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-12 23:00:13] [INFO ] Invariant cache hit.
[2023-03-12 23:00:15] [INFO ] Implicit Places using invariants in 1792 ms returned []
[2023-03-12 23:00:15] [INFO ] Invariant cache hit.
[2023-03-12 23:00:19] [INFO ] Implicit Places using invariants and state equation in 3389 ms returned []
Implicit Place search using SMT with State Equation took 5183 ms to find 0 implicit places.
[2023-03-12 23:00:19] [INFO ] Redundant transitions in 460 ms returned []
[2023-03-12 23:00:19] [INFO ] Invariant cache hit.
[2023-03-12 23:00:22] [INFO ] Dead Transitions using invariants and state equation in 2861 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8765 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 4 transition count 5
Applied a total of 167 rules in 16 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-12 23:00:22] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 23:00:22] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:00:22] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:00:22] [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 1 ms.
[2023-03-12 23:00:22] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 260 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 23:00:23] [INFO ] Computed 42 place invariants in 508 ms
[2023-03-12 23:00:25] [INFO ] Implicit Places using invariants in 2371 ms returned []
[2023-03-12 23:00:25] [INFO ] Invariant cache hit.
[2023-03-12 23:00:26] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 3172 ms to find 0 implicit places.
[2023-03-12 23:00:26] [INFO ] Invariant cache hit.
[2023-03-12 23:00:30] [INFO ] Dead Transitions using invariants and state equation in 4685 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8122 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78327 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78327 steps, saw 49115 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:00:34] [INFO ] Invariant cache hit.
[2023-03-12 23:00:34] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2023-03-12 23:00:35] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-12 23:00:39] [INFO ] After 4386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:00:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 23:00:40] [INFO ] After 885ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:00:40] [INFO ] After 5959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:00:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2023-03-12 23:00:40] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-12 23:00:45] [INFO ] After 4236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:00:54] [INFO ] After 9229ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-12 23:00:54] [INFO ] After 14048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 3 with 1641 rules applied. Total rules applied 6802 place count 1843 transition count 6519
Applied a total of 6802 rules in 1477 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1478 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 166 ms. (steps per millisecond=60 ) 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 104844 steps, run timeout after 3003 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104844 steps, saw 28127 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-12 23:00:59] [INFO ] Computed 42 place invariants in 233 ms
[2023-03-12 23:00:59] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-12 23:00:59] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 23:01:01] [INFO ] After 1604ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:01:01] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 23:01:02] [INFO ] After 720ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:01:02] [INFO ] After 2651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:01:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-12 23:01:02] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-12 23:01:03] [INFO ] After 1589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:01:05] [INFO ] After 1343ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:01:05] [INFO ] After 1682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-12 23:01:05] [INFO ] After 3736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 248 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 245 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-12 23:01:06] [INFO ] Invariant cache hit.
[2023-03-12 23:01:08] [INFO ] Implicit Places using invariants in 2116 ms returned []
[2023-03-12 23:01:08] [INFO ] Invariant cache hit.
[2023-03-12 23:01:09] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 23:01:09] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 3594 ms to find 0 implicit places.
[2023-03-12 23:01:10] [INFO ] Redundant transitions in 487 ms returned []
[2023-03-12 23:01:10] [INFO ] Invariant cache hit.
[2023-03-12 23:01:13] [INFO ] Dead Transitions using invariants and state equation in 2810 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7144 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 4 transition count 5
Applied a total of 167 rules in 10 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-12 23:01:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:01:13] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:01:13] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:01:13] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 23:01:13] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1987 ms.
Product exploration explored 100000 steps with 25000 reset in 1964 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 200 place count 3683 transition count 9840
Deduced a syphon composed of 240 places in 3 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 240 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 320 place count 3603 transition count 9760
Deduced a syphon composed of 160 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 400 place count 3603 transition count 9760
Performed 1599 Post agglomeration using F-continuation condition.Transition count delta: -3038
Deduced a syphon composed of 1759 places in 3 ms
Iterating global reduction 1 with 1599 rules applied. Total rules applied 1999 place count 3603 transition count 12798
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2159 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 2319 place count 3443 transition count 12638
Deduced a syphon composed of 1599 places in 3 ms
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 1 with 1481 rules applied. Total rules applied 3800 place count 3443 transition count 11157
Deduced a syphon composed of 1599 places in 2 ms
Applied a total of 3800 rules in 2254 ms. Remains 3443 /3683 variables (removed 240) and now considering 11157/9840 (removed -1317) transitions.
// Phase 1: matrix 11157 rows 3443 cols
[2023-03-12 23:01:20] [INFO ] Computed 42 place invariants in 493 ms
[2023-03-12 23:01:25] [INFO ] Dead Transitions using invariants and state equation in 5460 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3443/3683 places, 11157/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7716 ms. Remains : 3443/3683 places, 11157/9840 transitions.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 247 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 23:01:26] [INFO ] Computed 42 place invariants in 515 ms
[2023-03-12 23:01:27] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2023-03-12 23:01:27] [INFO ] Invariant cache hit.
[2023-03-12 23:01:30] [INFO ] Implicit Places using invariants and state equation in 3064 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
[2023-03-12 23:01:30] [INFO ] Invariant cache hit.
[2023-03-12 23:01:35] [INFO ] Dead Transitions using invariants and state equation in 5169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9976 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-06 finished in 129821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 6 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 256 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 23:01:36] [INFO ] Invariant cache hit.
[2023-03-12 23:01:36] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-12 23:01:36] [INFO ] Invariant cache hit.
[2023-03-12 23:01:40] [INFO ] Implicit Places using invariants and state equation in 3296 ms returned []
Implicit Place search using SMT with State Equation took 4029 ms to find 0 implicit places.
[2023-03-12 23:01:40] [INFO ] Invariant cache hit.
[2023-03-12 23:01:44] [INFO ] Dead Transitions using invariants and state equation in 4659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8946 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LEQ s1204 s158) (LEQ s243 s993)), p1:(OR (GT s3182 s3279) (GT s243 s993))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2363 ms.
Product exploration explored 100000 steps with 33333 reset in 2324 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-07 finished in 13990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p1 U p2))))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 297 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 23:01:50] [INFO ] Invariant cache hit.
[2023-03-12 23:01:50] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-12 23:01:50] [INFO ] Invariant cache hit.
[2023-03-12 23:01:53] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2862 ms to find 0 implicit places.
[2023-03-12 23:01:53] [INFO ] Invariant cache hit.
[2023-03-12 23:01:57] [INFO ] Dead Transitions using invariants and state equation in 4617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7777 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s2413), p2:(AND (LEQ 3 s2413) (LEQ 2 s2851) (LEQ s1353 s2706)), p1:(AND (LEQ 2 s2851) (LEQ s1353 s2706))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1160 steps with 0 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-08 finished in 7926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(X(F(p2))&&p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 246 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 23:01:58] [INFO ] Invariant cache hit.
[2023-03-12 23:01:58] [INFO ] Implicit Places using invariants in 854 ms returned []
[2023-03-12 23:01:58] [INFO ] Invariant cache hit.
[2023-03-12 23:02:02] [INFO ] Implicit Places using invariants and state equation in 3237 ms returned []
Implicit Place search using SMT with State Equation took 4095 ms to find 0 implicit places.
[2023-03-12 23:02:02] [INFO ] Invariant cache hit.
[2023-03-12 23:02:07] [INFO ] Dead Transitions using invariants and state equation in 5068 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9423 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ s1276 s1610), p1:(AND (GT s1627 s2526) (NOT (AND (LEQ s1627 s2526) (LEQ 1 s1087)))), p0:(AND (LEQ s1627 s2526) (LEQ 1 s1087))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12556 steps with 14 reset in 127 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-09 finished in 9694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1481 Post agglomeration using F-continuation condition.Transition count delta: 1481
Deduced a syphon composed of 1481 places in 4 ms
Reduce places removed 1481 places and 0 transitions.
Iterating global reduction 3 with 2962 rules applied. Total rules applied 3522 place count 1922 transition count 8079
Drop transitions removed 1405 transitions
Redundant transition composition rules discarded 1405 transitions
Iterating global reduction 3 with 1405 rules applied. Total rules applied 4927 place count 1922 transition count 6674
Partial Post-agglomeration rule applied 154 times.
Drop transitions removed 154 transitions
Iterating global reduction 3 with 154 rules applied. Total rules applied 5081 place count 1922 transition count 6674
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 5157 place count 1846 transition count 6598
Iterating global reduction 3 with 76 rules applied. Total rules applied 5233 place count 1846 transition count 6598
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 5271 place count 1846 transition count 6560
Applied a total of 5271 rules in 1732 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6560/9840 (removed 3280) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2023-03-12 23:02:09] [INFO ] Computed 42 place invariants in 196 ms
[2023-03-12 23:02:10] [INFO ] Implicit Places using invariants in 1482 ms returned []
[2023-03-12 23:02:10] [INFO ] Invariant cache hit.
[2023-03-12 23:02:11] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-12 23:02:14] [INFO ] Implicit Places using invariants and state equation in 3753 ms returned []
Implicit Place search using SMT with State Equation took 5239 ms to find 0 implicit places.
[2023-03-12 23:02:14] [INFO ] Redundant transitions in 469 ms returned []
[2023-03-12 23:02:14] [INFO ] Invariant cache hit.
[2023-03-12 23:02:17] [INFO ] Dead Transitions using invariants and state equation in 2843 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1846/3683 places, 6560/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10300 ms. Remains : 1846/3683 places, 6560/9840 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s927 s230) (GT 2 s1806))], 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 485 reset in 1125 ms.
Product exploration explored 100000 steps with 487 reset in 1089 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 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 :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 109681 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109681 steps, saw 30082 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:02:23] [INFO ] Invariant cache hit.
[2023-03-12 23:02:23] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-12 23:02:23] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:02:25] [INFO ] After 2102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:02:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 23:02:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:02:27] [INFO ] After 1615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:02:27] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-12 23:02:30] [INFO ] After 2672ms SMT Verify possible using 4793 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:02:30] [INFO ] After 3093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-12 23:02:30] [INFO ] After 5376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 691 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 1845/1846 places, 6559/6560 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 143 ms. (steps per millisecond=69 ) 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 102303 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102303 steps, saw 27854 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6559 rows 1845 cols
[2023-03-12 23:02:34] [INFO ] Computed 42 place invariants in 227 ms
[2023-03-12 23:02:35] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 23:02:35] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-12 23:02:37] [INFO ] After 2192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:02:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 23:02:37] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:02:39] [INFO ] After 1777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:02:39] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-12 23:02:42] [INFO ] After 3317ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:02:43] [INFO ] After 3832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-12 23:02:43] [INFO ] After 6367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 241 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 241 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2023-03-12 23:02:44] [INFO ] Invariant cache hit.
[2023-03-12 23:02:45] [INFO ] Implicit Places using invariants in 1918 ms returned []
[2023-03-12 23:02:45] [INFO ] Invariant cache hit.
[2023-03-12 23:02:46] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-12 23:02:47] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
[2023-03-12 23:02:47] [INFO ] Redundant transitions in 551 ms returned []
[2023-03-12 23:02:47] [INFO ] Invariant cache hit.
[2023-03-12 23:02:50] [INFO ] Dead Transitions using invariants and state equation in 2966 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7111 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Graph (trivial) has 6272 edges and 1845 vertex of which 1637 / 1845 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1635 places
Drop transitions removed 4561 transitions
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 6186 transitions.
Graph (complete) has 616 edges and 210 vertex of which 89 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 89 transition count 215
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 196 place count 14 transition count 66
Iterating global reduction 1 with 75 rules applied. Total rules applied 271 place count 14 transition count 66
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 308 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 312 place count 12 transition count 28
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 11 transition count 22
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 321 place count 10 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 10 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 10 transition count 19
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 325 place count 9 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 8 transition count 17
Applied a total of 327 rules in 14 ms. Remains 8 /1845 variables (removed 1837) and now considering 17/6559 (removed 6542) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 8 cols
[2023-03-12 23:02:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:02:50] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:02:51] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:02:51] [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.
[2023-03-12 23:02:51] [INFO ] After 27ms 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 120 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)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 185 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2023-03-12 23:02:51] [INFO ] Computed 42 place invariants in 195 ms
[2023-03-12 23:02:52] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2023-03-12 23:02:52] [INFO ] Invariant cache hit.
[2023-03-12 23:02:53] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-12 23:02:56] [INFO ] Implicit Places using invariants and state equation in 3421 ms returned []
Implicit Place search using SMT with State Equation took 4814 ms to find 0 implicit places.
[2023-03-12 23:02:56] [INFO ] Redundant transitions in 462 ms returned []
[2023-03-12 23:02:56] [INFO ] Invariant cache hit.
[2023-03-12 23:02:59] [INFO ] Dead Transitions using invariants and state equation in 3039 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8516 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
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 53 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 114700 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114700 steps, saw 31266 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:03:03] [INFO ] Invariant cache hit.
[2023-03-12 23:03:03] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 23:03:03] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 23:03:05] [INFO ] After 1928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:03:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2023-03-12 23:03:05] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-12 23:03:07] [INFO ] After 1653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:03:07] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-12 23:03:09] [INFO ] After 2545ms SMT Verify possible using 4793 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:03:09] [INFO ] After 2898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-12 23:03:10] [INFO ] After 5188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 554 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 555 ms. Remains : 1845/1846 places, 6559/6560 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94227 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94227 steps, saw 26858 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6559 rows 1845 cols
[2023-03-12 23:03:14] [INFO ] Computed 42 place invariants in 222 ms
[2023-03-12 23:03:14] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 23:03:14] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 23:03:16] [INFO ] After 1834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:03:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 23:03:16] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-12 23:03:18] [INFO ] After 1751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:03:18] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-12 23:03:21] [INFO ] After 3209ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:03:21] [INFO ] After 3711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-03-12 23:03:22] [INFO ] After 6164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 239 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 219 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2023-03-12 23:03:22] [INFO ] Invariant cache hit.
[2023-03-12 23:03:24] [INFO ] Implicit Places using invariants in 1941 ms returned []
[2023-03-12 23:03:24] [INFO ] Invariant cache hit.
[2023-03-12 23:03:25] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2023-03-12 23:03:35] [INFO ] Implicit Places using invariants and state equation in 10998 ms returned []
Implicit Place search using SMT with State Equation took 12941 ms to find 0 implicit places.
[2023-03-12 23:03:36] [INFO ] Redundant transitions in 459 ms returned []
[2023-03-12 23:03:36] [INFO ] Invariant cache hit.
[2023-03-12 23:03:39] [INFO ] Dead Transitions using invariants and state equation in 2915 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16548 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Graph (trivial) has 6272 edges and 1845 vertex of which 1637 / 1845 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1635 places
Drop transitions removed 4561 transitions
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 6186 transitions.
Graph (complete) has 616 edges and 210 vertex of which 89 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 89 transition count 215
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 196 place count 14 transition count 66
Iterating global reduction 1 with 75 rules applied. Total rules applied 271 place count 14 transition count 66
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 308 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 312 place count 12 transition count 28
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 11 transition count 22
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 321 place count 10 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 10 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 10 transition count 19
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 325 place count 9 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 8 transition count 17
Applied a total of 327 rules in 15 ms. Remains 8 /1845 variables (removed 1837) and now considering 17/6559 (removed 6542) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 8 cols
[2023-03-12 23:03:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:03:39] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:03:39] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:03:39] [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.
[2023-03-12 23:03:39] [INFO ] After 27ms 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 97 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 488 reset in 1225 ms.
Product exploration explored 100000 steps with 485 reset in 1164 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 184 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2023-03-12 23:03:42] [INFO ] Computed 42 place invariants in 192 ms
[2023-03-12 23:03:43] [INFO ] Implicit Places using invariants in 1330 ms returned []
[2023-03-12 23:03:43] [INFO ] Invariant cache hit.
[2023-03-12 23:03:44] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2023-03-12 23:03:46] [INFO ] Implicit Places using invariants and state equation in 3526 ms returned []
Implicit Place search using SMT with State Equation took 4858 ms to find 0 implicit places.
[2023-03-12 23:03:47] [INFO ] Redundant transitions in 481 ms returned []
[2023-03-12 23:03:47] [INFO ] Invariant cache hit.
[2023-03-12 23:03:50] [INFO ] Dead Transitions using invariants and state equation in 2786 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8324 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-10 finished in 102786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 4 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1122 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-12 23:03:51] [INFO ] Computed 42 place invariants in 198 ms
[2023-03-12 23:03:52] [INFO ] Implicit Places using invariants in 1363 ms returned []
[2023-03-12 23:03:52] [INFO ] Invariant cache hit.
[2023-03-12 23:03:53] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:03:56] [INFO ] Implicit Places using invariants and state equation in 3816 ms returned []
Implicit Place search using SMT with State Equation took 5183 ms to find 0 implicit places.
[2023-03-12 23:03:57] [INFO ] Redundant transitions in 493 ms returned []
[2023-03-12 23:03:57] [INFO ] Invariant cache hit.
[2023-03-12 23:03:59] [INFO ] Dead Transitions using invariants and state equation in 2871 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9684 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s902 s1169)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 491 reset in 1021 ms.
Stack based approach found an accepted trace after 2906 steps with 14 reset with depth 163 and stack size 162 in 36 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-11 finished in 10820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&F(p0))||(p2&&F(p0)))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 3 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 2 with 3116 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 2 with 1480 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Applied a total of 5156 rules in 1005 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
// Phase 1: matrix 6522 rows 1845 cols
[2023-03-12 23:04:02] [INFO ] Computed 42 place invariants in 143 ms
[2023-03-12 23:04:03] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2023-03-12 23:04:03] [INFO ] Invariant cache hit.
[2023-03-12 23:04:04] [INFO ] State equation strengthened by 4756 read => feed constraints.
[2023-03-12 23:04:06] [INFO ] Implicit Places using invariants and state equation in 3532 ms returned []
Implicit Place search using SMT with State Equation took 4834 ms to find 0 implicit places.
[2023-03-12 23:04:07] [INFO ] Redundant transitions in 532 ms returned []
[2023-03-12 23:04:07] [INFO ] Invariant cache hit.
[2023-03-12 23:04:10] [INFO ] Dead Transitions using invariants and state equation in 3005 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6522/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9385 ms. Remains : 1845/3683 places, 6522/9840 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), 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=[p1:(GT 2 s1085), p2:(LEQ s956 s1321), p0:(LEQ 3 s1511)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 235 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-12 finished in 9509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1069 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-12 23:04:11] [INFO ] Computed 42 place invariants in 173 ms
[2023-03-12 23:04:12] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2023-03-12 23:04:12] [INFO ] Invariant cache hit.
[2023-03-12 23:04:13] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:04:16] [INFO ] Implicit Places using invariants and state equation in 4016 ms returned []
Implicit Place search using SMT with State Equation took 5239 ms to find 0 implicit places.
[2023-03-12 23:04:17] [INFO ] Redundant transitions in 704 ms returned []
[2023-03-12 23:04:17] [INFO ] Invariant cache hit.
[2023-03-12 23:04:20] [INFO ] Dead Transitions using invariants and state equation in 2958 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9985 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1488 s1790)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 490 reset in 1005 ms.
Product exploration explored 100000 steps with 489 reset in 1066 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 3073 steps, including 14 resets, run visited all 1 properties in 31 ms. (steps per millisecond=99 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 210 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-12 23:04:23] [INFO ] Invariant cache hit.
[2023-03-12 23:04:24] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2023-03-12 23:04:24] [INFO ] Invariant cache hit.
[2023-03-12 23:04:25] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:04:28] [INFO ] Implicit Places using invariants and state equation in 3960 ms returned []
Implicit Place search using SMT with State Equation took 4999 ms to find 0 implicit places.
[2023-03-12 23:04:28] [INFO ] Redundant transitions in 462 ms returned []
[2023-03-12 23:04:28] [INFO ] Invariant cache hit.
[2023-03-12 23:04:31] [INFO ] Dead Transitions using invariants and state equation in 2996 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8676 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 4321 steps, including 21 resets, run visited all 1 properties in 62 ms. (steps per millisecond=69 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 489 reset in 996 ms.
Product exploration explored 100000 steps with 490 reset in 1020 ms.
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 188 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-12 23:04:34] [INFO ] Invariant cache hit.
[2023-03-12 23:04:35] [INFO ] Implicit Places using invariants in 973 ms returned []
[2023-03-12 23:04:35] [INFO ] Invariant cache hit.
[2023-03-12 23:04:36] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:04:38] [INFO ] Implicit Places using invariants and state equation in 3442 ms returned []
Implicit Place search using SMT with State Equation took 4422 ms to find 0 implicit places.
[2023-03-12 23:04:39] [INFO ] Redundant transitions in 502 ms returned []
[2023-03-12 23:04:39] [INFO ] Invariant cache hit.
[2023-03-12 23:04:42] [INFO ] Dead Transitions using invariants and state equation in 2838 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7961 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-13 finished in 31846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 3 with 3120 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 3 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 1048 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-12 23:04:43] [INFO ] Computed 42 place invariants in 188 ms
[2023-03-12 23:04:44] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2023-03-12 23:04:44] [INFO ] Invariant cache hit.
[2023-03-12 23:04:45] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-12 23:04:48] [INFO ] Implicit Places using invariants and state equation in 3514 ms returned []
Implicit Place search using SMT with State Equation took 4758 ms to find 0 implicit places.
[2023-03-12 23:04:48] [INFO ] Redundant transitions in 646 ms returned []
[2023-03-12 23:04:48] [INFO ] Invariant cache hit.
[2023-03-12 23:04:51] [INFO ] Dead Transitions using invariants and state equation in 2779 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9237 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s53 s803), p0:(OR (GT 1 s396) (GT 2 s833))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 496 reset in 1023 ms.
Product exploration explored 100000 steps with 494 reset in 954 ms.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:04:54] [INFO ] Invariant cache hit.
[2023-03-12 23:04:54] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-12 23:04:54] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-12 23:04:56] [INFO ] After 1620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:04:56] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-12 23:04:57] [INFO ] After 1078ms SMT Verify possible using 4758 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:04:57] [INFO ] After 3018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:04:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 23:04:57] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-12 23:04:59] [INFO ] After 1625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:05:00] [INFO ] After 979ms SMT Verify possible using 4758 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:05:00] [INFO ] After 1271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-12 23:05:00] [INFO ] After 3340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 693 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 694 ms. Remains : 1842/1845 places, 6517/6520 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 115922 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115922 steps, saw 32590 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2023-03-12 23:05:04] [INFO ] Computed 42 place invariants in 251 ms
[2023-03-12 23:05:04] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-12 23:05:04] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 29 ms returned sat
[2023-03-12 23:05:06] [INFO ] After 1374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:05:06] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 23:05:07] [INFO ] After 1040ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:05:07] [INFO ] After 2837ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:05:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 23:05:07] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-12 23:05:10] [INFO ] After 2708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:05:11] [INFO ] After 1220ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:05:12] [INFO ] After 1608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-12 23:05:12] [INFO ] After 4893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 257 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 243 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2023-03-12 23:05:12] [INFO ] Invariant cache hit.
[2023-03-12 23:05:14] [INFO ] Implicit Places using invariants in 1903 ms returned []
[2023-03-12 23:05:14] [INFO ] Invariant cache hit.
[2023-03-12 23:05:15] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 23:05:16] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 3220 ms to find 0 implicit places.
[2023-03-12 23:05:16] [INFO ] Redundant transitions in 608 ms returned []
[2023-03-12 23:05:16] [INFO ] Invariant cache hit.
[2023-03-12 23:05:19] [INFO ] Dead Transitions using invariants and state equation in 2586 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6664 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6270 edges and 1842 vertex of which 1677 / 1842 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1675 places
Drop transitions removed 4713 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6345 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 5 transition count 8
Applied a total of 167 rules in 9 ms. Remains 5 /1842 variables (removed 1837) and now considering 8/6517 (removed 6509) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 23:05:19] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:05:19] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:05:19] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:05:19] [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 1 ms.
[2023-03-12 23:05:19] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 274 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-12 23:05:20] [INFO ] Computed 42 place invariants in 194 ms
[2023-03-12 23:05:21] [INFO ] Implicit Places using invariants in 1401 ms returned []
[2023-03-12 23:05:21] [INFO ] Invariant cache hit.
[2023-03-12 23:05:22] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-12 23:05:24] [INFO ] Implicit Places using invariants and state equation in 3566 ms returned []
Implicit Place search using SMT with State Equation took 4972 ms to find 0 implicit places.
[2023-03-12 23:05:25] [INFO ] Redundant transitions in 567 ms returned []
[2023-03-12 23:05:25] [INFO ] Invariant cache hit.
[2023-03-12 23:05:28] [INFO ] Dead Transitions using invariants and state equation in 2849 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8678 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 106845 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106845 steps, saw 29749 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 23:05:31] [INFO ] Invariant cache hit.
[2023-03-12 23:05:32] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:05:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 23:05:32] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 23:05:34] [INFO ] After 2423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:05:35] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-12 23:05:36] [INFO ] After 1331ms SMT Verify possible using 4758 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 23:05:37] [INFO ] After 2054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 469 ms.
[2023-03-12 23:05:37] [INFO ] After 5310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 7 ms.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 761 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 761 ms. Remains : 1842/1845 places, 6517/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 149 ms. (steps per millisecond=67 ) 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 104211 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104211 steps, saw 28060 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2023-03-12 23:05:41] [INFO ] Computed 42 place invariants in 284 ms
[2023-03-12 23:05:42] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-12 23:05:42] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:05:43] [INFO ] After 1583ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:05:43] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 23:05:44] [INFO ] After 1146ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:05:44] [INFO ] After 3194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:05:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-12 23:05:45] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 23:05:47] [INFO ] After 2617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:05:49] [INFO ] After 1163ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:05:49] [INFO ] After 1461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-12 23:05:49] [INFO ] After 4578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 263 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 258 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2023-03-12 23:05:50] [INFO ] Invariant cache hit.
[2023-03-12 23:05:52] [INFO ] Implicit Places using invariants in 1983 ms returned []
[2023-03-12 23:05:52] [INFO ] Invariant cache hit.
[2023-03-12 23:05:53] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2023-03-12 23:06:04] [INFO ] Implicit Places using invariants and state equation in 12233 ms returned []
Implicit Place search using SMT with State Equation took 14220 ms to find 0 implicit places.
[2023-03-12 23:06:04] [INFO ] Redundant transitions in 529 ms returned []
[2023-03-12 23:06:04] [INFO ] Invariant cache hit.
[2023-03-12 23:06:07] [INFO ] Dead Transitions using invariants and state equation in 2979 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18001 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6270 edges and 1842 vertex of which 1677 / 1842 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1675 places
Drop transitions removed 4713 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6345 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 5 transition count 8
Applied a total of 167 rules in 13 ms. Remains 5 /1842 variables (removed 1837) and now considering 8/6517 (removed 6509) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 23:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:06:07] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:06:07] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:06:07] [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.
[2023-03-12 23:06:07] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 282 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 503 reset in 1184 ms.
Product exploration explored 100000 steps with 495 reset in 1073 ms.
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 199 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-12 23:06:11] [INFO ] Computed 42 place invariants in 198 ms
[2023-03-12 23:06:12] [INFO ] Implicit Places using invariants in 1485 ms returned []
[2023-03-12 23:06:12] [INFO ] Invariant cache hit.
[2023-03-12 23:06:13] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2023-03-12 23:06:16] [INFO ] Implicit Places using invariants and state equation in 3631 ms returned []
Implicit Place search using SMT with State Equation took 5118 ms to find 0 implicit places.
[2023-03-12 23:06:16] [INFO ] Redundant transitions in 456 ms returned []
[2023-03-12 23:06:16] [INFO ] Invariant cache hit.
[2023-03-12 23:06:19] [INFO ] Dead Transitions using invariants and state equation in 2896 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8681 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-15 finished in 97219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-040-LTLCardinality-06
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 927 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-12 23:06:21] [INFO ] Computed 42 place invariants in 196 ms
[2023-03-12 23:06:22] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2023-03-12 23:06:22] [INFO ] Invariant cache hit.
[2023-03-12 23:06:23] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:06:25] [INFO ] Implicit Places using invariants and state equation in 3522 ms returned []
Implicit Place search using SMT with State Equation took 4917 ms to find 0 implicit places.
[2023-03-12 23:06:25] [INFO ] Invariant cache hit.
[2023-03-12 23:06:28] [INFO ] Dead Transitions using invariants and state equation in 2989 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8834 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 2 s945)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1536 ms.
Product exploration explored 100000 steps with 25000 reset in 1554 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118714 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118714 steps, saw 31920 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:06:35] [INFO ] Invariant cache hit.
[2023-03-12 23:06:35] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 23:06:35] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-12 23:06:37] [INFO ] After 1692ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:06:37] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:06:38] [INFO ] After 630ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:06:38] [INFO ] After 2698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:06:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 23:06:38] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:06:40] [INFO ] After 1752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:06:41] [INFO ] After 1338ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:06:41] [INFO ] After 1635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-12 23:06:42] [INFO ] After 3957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1643 place count 1843 transition count 6519
Applied a total of 1643 rules in 770 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 114968 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114968 steps, saw 32436 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-12 23:06:46] [INFO ] Computed 42 place invariants in 242 ms
[2023-03-12 23:06:46] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-12 23:06:46] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-12 23:06:47] [INFO ] After 1467ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:06:48] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 23:06:48] [INFO ] After 745ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:06:48] [INFO ] After 2590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:06:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 23:06:49] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-12 23:06:50] [INFO ] After 1673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:06:51] [INFO ] After 1265ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:06:52] [INFO ] After 1648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 265 ms.
[2023-03-12 23:06:52] [INFO ] After 3871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 252 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 276 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-12 23:06:53] [INFO ] Invariant cache hit.
[2023-03-12 23:06:55] [INFO ] Implicit Places using invariants in 2040 ms returned []
[2023-03-12 23:06:55] [INFO ] Invariant cache hit.
[2023-03-12 23:06:56] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 23:07:06] [INFO ] Implicit Places using invariants and state equation in 11609 ms returned []
Implicit Place search using SMT with State Equation took 13651 ms to find 0 implicit places.
[2023-03-12 23:07:07] [INFO ] Redundant transitions in 456 ms returned []
[2023-03-12 23:07:07] [INFO ] Invariant cache hit.
[2023-03-12 23:07:10] [INFO ] Dead Transitions using invariants and state equation in 2840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17235 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 4 transition count 5
Applied a total of 167 rules in 11 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-12 23:07:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:07:10] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:07:10] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:07:10] [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.
[2023-03-12 23:07:10] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 124 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-12 23:07:10] [INFO ] Computed 42 place invariants in 212 ms
[2023-03-12 23:07:12] [INFO ] Implicit Places using invariants in 1450 ms returned []
[2023-03-12 23:07:12] [INFO ] Invariant cache hit.
[2023-03-12 23:07:12] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:07:15] [INFO ] Implicit Places using invariants and state equation in 3576 ms returned []
Implicit Place search using SMT with State Equation took 5028 ms to find 0 implicit places.
[2023-03-12 23:07:15] [INFO ] Invariant cache hit.
[2023-03-12 23:07:18] [INFO ] Dead Transitions using invariants and state equation in 2572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7725 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118946 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118946 steps, saw 31948 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:07:21] [INFO ] Invariant cache hit.
[2023-03-12 23:07:21] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 23:07:21] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-12 23:07:23] [INFO ] After 1690ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:07:23] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:07:24] [INFO ] After 594ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:07:24] [INFO ] After 2663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:07:24] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 23:07:24] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-12 23:07:26] [INFO ] After 1829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:07:27] [INFO ] After 1309ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:07:28] [INFO ] After 1596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 223 ms.
[2023-03-12 23:07:28] [INFO ] After 3986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1643 place count 1843 transition count 6519
Applied a total of 1643 rules in 726 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 115072 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115072 steps, saw 32457 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2023-03-12 23:07:32] [INFO ] Computed 42 place invariants in 222 ms
[2023-03-12 23:07:32] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 23:07:32] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-12 23:07:34] [INFO ] After 1546ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:07:34] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 23:07:35] [INFO ] After 708ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:07:35] [INFO ] After 2654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:07:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 23:07:35] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-12 23:07:36] [INFO ] After 1521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:07:38] [INFO ] After 1251ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:07:38] [INFO ] After 1632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-12 23:07:38] [INFO ] After 3733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 272 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 271 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2023-03-12 23:07:39] [INFO ] Invariant cache hit.
[2023-03-12 23:07:41] [INFO ] Implicit Places using invariants in 1908 ms returned []
[2023-03-12 23:07:41] [INFO ] Invariant cache hit.
[2023-03-12 23:07:42] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2023-03-12 23:07:53] [INFO ] Implicit Places using invariants and state equation in 12324 ms returned []
Implicit Place search using SMT with State Equation took 14251 ms to find 0 implicit places.
[2023-03-12 23:07:54] [INFO ] Redundant transitions in 711 ms returned []
[2023-03-12 23:07:54] [INFO ] Invariant cache hit.
[2023-03-12 23:07:56] [INFO ] Dead Transitions using invariants and state equation in 2540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17792 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 4 transition count 5
Applied a total of 167 rules in 10 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-12 23:07:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:07:56] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:07:56] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:07:56] [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 3 ms.
[2023-03-12 23:07:56] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1593 ms.
Product exploration explored 100000 steps with 25000 reset in 1581 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 191 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-12 23:08:01] [INFO ] Redundant transitions in 409 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-12 23:08:01] [INFO ] Computed 42 place invariants in 120 ms
[2023-03-12 23:08:04] [INFO ] Dead Transitions using invariants and state equation in 2797 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3420 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 115 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-12 23:08:04] [INFO ] Invariant cache hit.
[2023-03-12 23:08:05] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2023-03-12 23:08:05] [INFO ] Invariant cache hit.
[2023-03-12 23:08:06] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:08:08] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
[2023-03-12 23:08:08] [INFO ] Invariant cache hit.
[2023-03-12 23:08:11] [INFO ] Dead Transitions using invariants and state equation in 2643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7311 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-06 finished in 112009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
[2023-03-12 23:08:12] [INFO ] Flatten gal took : 194 ms
[2023-03-12 23:08:12] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 23:08:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3683 places, 9840 transitions and 26320 arcs took 40 ms.
Total runtime 905173 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2530/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2530/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2530/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2530/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2530/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-040-LTLCardinality-02
Could not compute solution for formula : CANInsertWithFailure-PT-040-LTLCardinality-06
Could not compute solution for formula : CANInsertWithFailure-PT-040-LTLCardinality-10
Could not compute solution for formula : CANInsertWithFailure-PT-040-LTLCardinality-13
Could not compute solution for formula : CANInsertWithFailure-PT-040-LTLCardinality-15
BK_STOP 1678662514217
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-040-LTLCardinality-02
ltl formula formula --ltl=/tmp/2530/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3683 places, 9840 transitions and 26320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.010 real 0.380 user 0.490 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2530/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2530/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2530/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2530/ltl_0_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55ee31fc63f4]
1: pnml2lts-mc(+0xa2496) [0x55ee31fc6496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f393e883140]
3: pnml2lts-mc(+0x405be5) [0x55ee32329be5]
4: pnml2lts-mc(+0x16b3f9) [0x55ee3208f3f9]
5: pnml2lts-mc(+0x164ac4) [0x55ee32088ac4]
6: pnml2lts-mc(+0x272e0a) [0x55ee32196e0a]
7: pnml2lts-mc(+0xb61f0) [0x55ee31fda1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f393e6d64d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f393e6d667a]
10: pnml2lts-mc(+0xa1581) [0x55ee31fc5581]
11: pnml2lts-mc(+0xa1910) [0x55ee31fc5910]
12: pnml2lts-mc(+0xa32a2) [0x55ee31fc72a2]
13: pnml2lts-mc(+0xa50f4) [0x55ee31fc90f4]
14: pnml2lts-mc(+0xa516b) [0x55ee31fc916b]
15: pnml2lts-mc(+0x3f34b3) [0x55ee323174b3]
16: pnml2lts-mc(+0x7c63d) [0x55ee31fa063d]
17: pnml2lts-mc(+0x67d86) [0x55ee31f8bd86]
18: pnml2lts-mc(+0x60a8a) [0x55ee31f84a8a]
19: pnml2lts-mc(+0x5eb15) [0x55ee31f82b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f393e6bed0a]
21: pnml2lts-mc(+0x6075e) [0x55ee31f8475e]
ltl formula name CANInsertWithFailure-PT-040-LTLCardinality-06
ltl formula formula --ltl=/tmp/2530/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3683 places, 9840 transitions and 26320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.250 real 0.340 user 0.420 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2530/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2530/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2530/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2530/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANInsertWithFailure-PT-040-LTLCardinality-10
ltl formula formula --ltl=/tmp/2530/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3683 places, 9840 transitions and 26320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.170 real 0.380 user 0.340 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2530/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2530/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2530/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2530/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55f5966ce3f4]
1: pnml2lts-mc(+0xa2496) [0x55f5966ce496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f6f3d4cd140]
3: pnml2lts-mc(+0x405be5) [0x55f596a31be5]
4: pnml2lts-mc(+0x16b3f9) [0x55f5967973f9]
5: pnml2lts-mc(+0x164ac4) [0x55f596790ac4]
6: pnml2lts-mc(+0x272e0a) [0x55f59689ee0a]
7: pnml2lts-mc(+0xb61f0) [0x55f5966e21f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f6f3d3204d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f6f3d32067a]
10: pnml2lts-mc(+0xa1581) [0x55f5966cd581]
11: pnml2lts-mc(+0xa1910) [0x55f5966cd910]
12: pnml2lts-mc(+0xa32a2) [0x55f5966cf2a2]
13: pnml2lts-mc(+0xa50f4) [0x55f5966d10f4]
14: pnml2lts-mc(+0xa516b) [0x55f5966d116b]
15: pnml2lts-mc(+0x3f34b3) [0x55f596a1f4b3]
16: pnml2lts-mc(+0x7c63d) [0x55f5966a863d]
17: pnml2lts-mc(+0x67d86) [0x55f596693d86]
18: pnml2lts-mc(+0x60a8a) [0x55f59668ca8a]
19: pnml2lts-mc(+0x5eb15) [0x55f59668ab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f6f3d308d0a]
21: pnml2lts-mc(+0x6075e) [0x55f59668c75e]
ltl formula name CANInsertWithFailure-PT-040-LTLCardinality-13
ltl formula formula --ltl=/tmp/2530/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3683 places, 9840 transitions and 26320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.230 real 0.400 user 0.380 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2530/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2530/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2530/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2530/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CANInsertWithFailure-PT-040-LTLCardinality-15
ltl formula formula --ltl=/tmp/2530/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3683 places, 9840 transitions and 26320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.170 real 0.300 user 0.420 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2530/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2530/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2530/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2530/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-040, 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 r041-tajo-167813695100731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 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 ;