YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef1, oldX1^0 -> undef2, oldX2^0 -> undef3, x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> ((0 + (~(1) * undef2)) + undef3)}> undef10, oldX1^0 -> undef11, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef13, x0^0 -> (0 + undef10), x1^0 -> (0 + undef11), x2^0 -> (0 + undef13)}> undef19, oldX1^0 -> undef20, oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20), x2^0 -> (0 + undef22)}> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef40, oldX4^0 -> undef41, oldX5^0 -> undef42, x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> undef46, oldX1^0 -> undef47, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef46), x1^0 -> (0 + undef47), x2^0 -> (0 + undef46)}> undef55, oldX1^0 -> undef56, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef55), x1^0 -> (0 + undef56), x2^0 -> (0 + undef55)}> undef64, oldX1^0 -> undef65, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef67, x0^0 -> (0 + undef64), x1^0 -> (0 + undef65), x2^0 -> (0 + undef67)}> undef73, oldX1^0 -> undef74, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef76, x0^0 -> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef76)}> Fresh variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Undef variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> Fresh variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Undef variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> Variables: x0^0, x1^0, x2^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> Graph 2 undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001855 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000701s Ranking function: -1 - x1^0 + x2^0 New Graphs: Proving termination of subgraph 2 Analyzing SCC {l4}... No cycles found. Program Terminates