YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (0 + ret_check838^0)}> (0 + __const_10^0)}> 0}> (0 + __const_50^0)}> (1 + i20^0)}> 0}> (0 + ret_check1026^0)}> (0 + __const_10^0)}> 0}> (0 + ret_check824^0)}> (0 + __const_10^0)}> 0}> (0 + __const_200^0)}> (1 + i6^0)}> 0}> (0 + ret_check1012^0)}> (0 + __const_10^0)}> 0}> (0 + ret_check810^0)}> (1 + i48^0)}> 0}> (0 + ret_check1054^0)}> (0 + __const_10^0)}> 0}> (0 + ret_check852^0)}> (0 + __const_10^0)}> 0}> (0 + __const_20^0)}> (0 + __const_10^0)}> 0}> (1 + i34^0)}> 0}> (0 + ret_check1040^0)}> (0 + __const_10^0)}> 0}> (0 + __const_100^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + (0 + __const_10^0))}> (0 + 0)}> (0 + (0 + __const_10^0))}> (0 + 0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0)}> (0 + __const_200^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0)}> (0 + __const_200^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_20^0)}> (0 + __const_20^0)}> 0, tmp___036^0 -> (0 + (0 + __const_10^0))}> (0 + __const_20^0), tmp___036^0 -> (0 + 0)}> (0 + __const_20^0), tmp___036^0 -> (0 + 0)}> 0, tmp___036^0 -> (0 + (0 + __const_10^0))}> (0 + __const_20^0), tmp___036^0 -> (0 + 0)}> (0 + __const_20^0), tmp___036^0 -> (0 + 0)}> (0 + __const_20^0)}> (0 + __const_20^0)}> (0 + __const_20^0)}> (0 + __const_20^0)}> (0 + __const_50^0)}> (1 + i20^0)}> (0 + __const_50^0)}> 0}> 0}> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0)}> (0 + __const_200^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (1 + i6^0)}> (0 + __const_20^0)}> (0 + __const_20^0)}> (1 + i34^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0)}> (0 + __const_200^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> (0 + __const_200^0), n33^0 -> (0 + __const_50^0)}> 0}> 0}> (1 + i48^0)}> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: Variables: Graph 2: Transitions: 1 + i6^0, rest remain the same}> Variables: i6^0, n5^0 Graph 3: Transitions: Variables: Graph 4: Transitions: 1 + i20^0, rest remain the same}> Variables: i20^0, n19^0 Graph 5: Transitions: Variables: Graph 6: Transitions: 1 + i34^0, rest remain the same}> Variables: i34^0, n33^0 Graph 7: Transitions: Variables: Graph 8: Transitions: Variables: Graph 9: Transitions: 1 + i48^0, rest remain the same}> Variables: i48^0, n47^0 Graph 10: Transitions: Variables: Precedence: Graph 0 Graph 1 __const_10^0, rest remain the same}> 0, rest remain the same}> __const_10^0, rest remain the same}> 0, rest remain the same}> Graph 2 0, rest remain the same}> 0, rest remain the same}> Graph 3 __const_200^0, rest remain the same}> __const_200^0, rest remain the same}> __const_200^0, rest remain the same}> __const_200^0, rest remain the same}> __const_200^0, rest remain the same}> __const_200^0, rest remain the same}> __const_200^0, rest remain the same}> __const_200^0, rest remain the same}> Graph 4 0, rest remain the same}> 0, rest remain the same}> Graph 5 __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_50^0, rest remain the same}> __const_50^0, rest remain the same}> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> __const_200^0, n33^0 -> __const_50^0, rest remain the same}> Graph 6 0, tmp___036^0 -> __const_10^0, rest remain the same}> 0, tmp___036^0 -> __const_10^0, rest remain the same}> Graph 7 __const_20^0, rest remain the same}> __const_20^0, tmp___036^0 -> 0, rest remain the same}> __const_20^0, tmp___036^0 -> 0, rest remain the same}> __const_20^0, rest remain the same}> __const_20^0, rest remain the same}> __const_20^0, rest remain the same}> Graph 8 Graph 9 0, rest remain the same}> 0, rest remain the same}> Graph 10 __const_20^0, rest remain the same}> __const_20^0, tmp___036^0 -> 0, rest remain the same}> __const_20^0, tmp___036^0 -> 0, rest remain the same}> __const_20^0, rest remain the same}> __const_20^0, rest remain the same}> __const_20^0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 7 , 5 ) ( 13 , 4 ) ( 17 , 3 ) ( 22 , 2 ) ( 25 , 6 ) ( 29 , 1 ) ( 31 , 9 ) ( 37 , 10 ) ( 41 , 8 ) ( 45 , 7 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Analyzing SCC {l29}... No cycles found. Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001153 Checking conditional termination of SCC {l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001027s Ranking function: -1 - i6^0 + n5^0 New Graphs: Proving termination of subgraph 3 Analyzing SCC {l17}... No cycles found. Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.001036 Checking conditional termination of SCC {l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001061s Ranking function: -1 - i20^0 + n19^0 New Graphs: Proving termination of subgraph 5 Analyzing SCC {l7}... No cycles found. Proving termination of subgraph 6 Checking unfeasibility... Time used: 0.001058 Checking conditional termination of SCC {l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001052s Ranking function: -1 - i34^0 + n33^0 New Graphs: Proving termination of subgraph 7 Analyzing SCC {l45}... No cycles found. Proving termination of subgraph 8 Analyzing SCC {l41}... No cycles found. Proving termination of subgraph 9 Checking unfeasibility... Time used: 0.001052 Checking conditional termination of SCC {l31}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001072s Ranking function: -1 - i48^0 + n47^0 New Graphs: Proving termination of subgraph 10 Analyzing SCC {l37}... No cycles found. Program Terminates