Paths:infeasible paths A path p through a flow graph for program P is Start considered feasible if there exits at least one test int x,y.power: case which when input to P causes p to be floatZ input(仪y: traversed. if (y<0) true false power=-y: power-y: 3 214 false while (power!=0) true 6 2=2X power=power-1: if (y<0) 7 P1=(Start,1,3,4,5,6,5,7,8,9,End) false Itrue p2=(Start,1,2,4,5,7,9,End) 2=128 output(z) 9 End 1212 Paths: infeasible paths • A path p through a flow graph for program P is considered feasible if there exits at least one test case which when input to P causes p to be traversed. 𝑝1 = (Start, 1, 3, 4, 5, 6, 5, 7, 8,9 , End) 𝑝2 = (Start, 1, 2, 4, 5, 7, 9, End)