HW4:Royal Garden’s Puzzle as a Model Checking Problem Pictures from UbiSoft

R1 R2R3R4 R8 R9R10R11 R5 R6R7 H1 H2 H3 H4 Source Sink HandleAreas rotated H1R1,R2,R5,R6 H2R2,R3,R4,R6,R7 H3R5,R6,R8,R9,R10 H4-R6,R7,-R10,R11 Type A Type B Type C

To-do list: 1. Write down a C program to model the game and get a solution by using model checking (i.e. CBMC) – Hint: the C program will be quite similar to the random one – Use non-determinism for the handle and direction choices and __CPROVER_ assume() properly – Use assert statement to detect when the route is established 2. Find the shortest solution by and analyzing counter examples. Also show that why your solution is the shortest one for the route. – Hint: there exists a solution less than 10 steps