YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> undef7, oldX1^0 -> undef8, x0^0 -> (~(1) + undef7), x1^0 -> (~(1) + undef8)}> undef13, oldX1^0 -> undef14, oldX2^0 -> undef15, oldX3^0 -> undef16, x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + x0^0), oldX1^0 -> undef20, oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}> (0 + x0^0), oldX1^0 -> undef26, oldX2^0 -> undef27, oldX3^0 -> undef28, x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}> undef31, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef33, oldX3^0 -> undef34, x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}> undef37, 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 -> (0 + 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)}> undef61, oldX1^0 -> undef62, x0^0 -> (0 + undef61), x1^0 -> (0 + undef62)}> Fresh variables: undef3, undef4, undef7, undef8, undef13, undef14, undef15, undef16, undef20, undef21, undef22, undef26, undef27, undef28, undef31, undef33, undef34, undef37, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef61, undef62, Undef variables: undef3, undef4, undef7, undef8, undef13, undef14, undef15, undef16, undef20, undef21, undef22, undef26, undef27, undef28, undef31, undef33, undef34, undef37, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef61, undef62, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef43), x1^0 -> (0 + undef44)}> (0 + undef49), x1^0 -> (0 + undef50)}> (0 + undef55), x1^0 -> (0 + undef56)}> (0 + undef43), x1^0 -> (0 + undef44)}> (0 + undef49), x1^0 -> (0 + undef50)}> (0 + undef55), x1^0 -> (0 + undef56)}> (0 + undef3), x1^0 -> (0 + undef4)}> (0 + undef43), x1^0 -> (0 + undef44)}> (0 + undef49), x1^0 -> (0 + undef50)}> (0 + undef55), x1^0 -> (0 + undef56)}> (0 + undef15), x1^0 -> (0 + undef16)}> (0 + undef21), x1^0 -> (0 + undef22)}> (0 + undef27), x1^0 -> (0 + undef28)}> (0 + undef33), x1^0 -> (0 + undef34)}> (0 + undef39), x1^0 -> (0 + undef40)}> Fresh variables: undef3, undef4, undef7, undef8, undef13, undef14, undef15, undef16, undef20, undef21, undef22, undef26, undef27, undef28, undef31, undef33, undef34, undef37, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef61, undef62, Undef variables: undef3, undef4, undef7, undef8, undef13, undef14, undef15, undef16, undef20, undef21, undef22, undef26, undef27, undef28, undef31, undef33, undef34, undef37, undef39, undef40, undef43, undef44, undef49, undef50, undef55, undef56, undef61, undef62, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef43, x1^0 -> undef44, rest remain the same}> Variables: x0^0, x1^0 Graph 2: Transitions: Variables: Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 undef43, x1^0 -> undef44, rest remain the same}> undef43, x1^0 -> undef44, rest remain the same}> Graph 2 undef49, x1^0 -> undef50, rest remain the same}> undef55, x1^0 -> undef56, rest remain the same}> undef49, x1^0 -> undef50, rest remain the same}> undef55, x1^0 -> undef56, rest remain the same}> undef49, x1^0 -> undef50, rest remain the same}> undef55, x1^0 -> undef56, rest remain the same}> Graph 3 undef3, x1^0 -> undef4, rest remain the same}> undef15, x1^0 -> undef16, rest remain the same}> undef21, x1^0 -> undef22, rest remain the same}> undef27, x1^0 -> undef28, rest remain the same}> undef33, x1^0 -> undef34, rest remain the same}> undef39, x1^0 -> undef40, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 3 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002973 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001298s Ranking function: -2 + x0^0 New Graphs: Proving termination of subgraph 2 Analyzing SCC {l4}... No cycles found. Proving termination of subgraph 3 Analyzing SCC {l2}... No cycles found. Program Terminates