YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef1, oldX1^0 -> undef2, x0^0 -> (0 + undef1), x1^0 -> (0 + undef2)}> undef7, oldX1^0 -> undef8, x0^0 -> (0 + undef7), x1^0 -> (0 + undef8)}> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (0 + undef14)}> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef33, oldX3^0 -> undef34, x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, oldX3^0 -> undef40, x0^0 -> (0 + undef39), x1^0 -> (0 + undef40)}> undef43, oldX1^0 -> undef44, x0^0 -> (~(1) + undef43), x1^0 -> (0 + undef44)}> undef49, oldX1^0 -> undef50, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50)}> undef55, oldX1^0 -> undef56, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef63, oldX3^0 -> undef64, x0^0 -> (0 + undef63), x1^0 -> (0 + undef64)}> undef67, oldX1^0 -> undef68, x0^0 -> (0 + undef67), x1^0 -> (~(1) + undef68)}> undef73, oldX1^0 -> undef74, x0^0 -> (0 + undef73), x1^0 -> (0 + undef74)}> undef79, oldX1^0 -> undef80, x0^0 -> (0 + undef79), x1^0 -> (0 + undef80)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef87, oldX3^0 -> undef88, x0^0 -> (0 + undef87), x1^0 -> (0 + undef88)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef93, oldX3^0 -> undef94, x0^0 -> (0 + undef93), x1^0 -> (0 + undef94)}> undef97, oldX1^0 -> undef98, x0^0 -> (0 + undef97), x1^0 -> (~(1) + undef98)}> undef103, oldX1^0 -> undef104, x0^0 -> (0 + undef103), x1^0 -> (0 + undef104)}> Fresh variables: undef1, undef2, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef63, undef64, undef67, undef68, undef73, undef74, undef79, undef80, undef87, undef88, undef93, undef94, undef97, undef98, undef103, undef104, Undef variables: undef1, undef2, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef63, undef64, undef67, undef68, undef73, undef74, undef79, undef80, undef87, undef88, undef93, undef94, undef97, undef98, undef103, undef104, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef25), x1^0 -> (0 + undef26)}> (0 + undef33), x1^0 -> (0 + undef34)}> (0 + undef39), x1^0 -> (0 + undef40)}> (~(1) + undef43), x1^0 -> (0 + undef44)}> (0 + undef63), x1^0 -> (0 + undef64)}> (0 + undef67), x1^0 -> (~(1) + undef68)}> (0 + undef73), x1^0 -> (0 + undef74)}> (0 + undef63), x1^0 -> (0 + undef64)}> (0 + undef67), x1^0 -> (~(1) + undef68)}> (0 + undef87), x1^0 -> (0 + undef88)}> (0 + undef93), x1^0 -> (0 + undef94)}> (0 + undef25), x1^0 -> (0 + undef26)}> (0 + undef87), x1^0 -> (0 + undef88)}> (0 + undef87), x1^0 -> (0 + undef88)}> (0 + undef93), x1^0 -> (0 + undef94)}> (0 + undef25), x1^0 -> (0 + undef26)}> (0 + undef73), x1^0 -> (0 + undef74)}> (0 + undef63), x1^0 -> (0 + undef64)}> (0 + undef67), x1^0 -> (~(1) + undef68)}> (0 + undef33), x1^0 -> (0 + undef34)}> (0 + undef39), x1^0 -> (0 + undef40)}> (~(1) + undef43), x1^0 -> (0 + undef44)}> Fresh variables: undef1, undef2, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef63, undef64, undef67, undef68, undef73, undef74, undef79, undef80, undef87, undef88, undef93, undef94, undef97, undef98, undef103, undef104, Undef variables: undef1, undef2, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef63, undef64, undef67, undef68, undef73, undef74, undef79, undef80, undef87, undef88, undef93, undef94, undef97, undef98, undef103, undef104, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef73, x1^0 -> undef74, rest remain the same}> undef67, x1^0 -> -1 + undef68, rest remain the same}> -1 + undef43, x1^0 -> undef44, rest remain the same}> Variables: x0^0, x1^0 Graph 2: Transitions: Variables: Graph 3: Transitions: undef25, x1^0 -> undef26, rest remain the same}> Variables: x0^0, x1^0 Graph 4: Transitions: Variables: Precedence: Graph 0 Graph 1 -1 + undef43, x1^0 -> undef44, rest remain the same}> undef67, x1^0 -> -1 + undef68, rest remain the same}> undef73, x1^0 -> undef74, rest remain the same}> undef67, x1^0 -> -1 + undef68, rest remain the same}> Graph 2 undef33, x1^0 -> undef34, rest remain the same}> undef39, x1^0 -> undef40, rest remain the same}> undef63, x1^0 -> undef64, rest remain the same}> undef63, x1^0 -> undef64, rest remain the same}> undef63, x1^0 -> undef64, rest remain the same}> undef33, x1^0 -> undef34, rest remain the same}> undef39, x1^0 -> undef40, rest remain the same}> Graph 3 undef25, x1^0 -> undef26, rest remain the same}> undef25, x1^0 -> undef26, rest remain the same}> Graph 4 undef87, x1^0 -> undef88, rest remain the same}> undef93, x1^0 -> undef94, rest remain the same}> undef87, x1^0 -> undef88, rest remain the same}> undef87, x1^0 -> undef88, rest remain the same}> undef93, x1^0 -> undef94, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 3 ) ( 6 , 2 ) ( 8 , 1 ) ( 9 , 1 ) ( 12 , 4 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007854 Checking conditional termination of SCC {l8, l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002954s Ranking function: -4 + 4*x1^0 New Graphs: Transitions: -1 + undef43, x1^0 -> undef44, rest remain the same}> Variables: x0^0, x1^0 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001404s Ranking function: -1 + x0^0 New Graphs: Proving termination of subgraph 2 Analyzing SCC {l6}... No cycles found. Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.002377 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001293s Ranking function: -1 + x1^0 New Graphs: Proving termination of subgraph 4 Analyzing SCC {l12}... No cycles found. Program Terminates