YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef34}> (0 + cword25^0)}> undef81, j24^0 -> (1 + j24^0)}> undef137}> undef172}> undef291}> 1}> undef396}> (1 + i1128^0)}> undef460}> undef495}> (1 + j24^0), ret_icrc11330^0 -> (0 + ans1229^0)}> undef671, crc926^0 -> undef675, i1128^0 -> 0, onech1027^0 -> 0}> 1, j24^0 -> 0}> undef847, cword25^0 -> (0 + undef847), i1^0 -> undef855, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0), ret_icrc17^0 -> undef871}> undef946}> (0 + cword11^0)}> undef991, j10^0 -> (1 + j10^0)}> undef1049}> undef1084}> undef1201}> 1}> undef1341}> (1 + i1114^0)}> undef1440}> undef1475}> (1 + j10^0), ret_icrc11316^0 -> (0 + ans1215^0)}> undef1651, crc912^0 -> undef1655, i1114^0 -> 0, onech1013^0 -> 0}> 1, j10^0 -> 0}> (0 + undef1818), ret_icrc31^0 -> undef1818}> undef1829, cword11^0 -> (0 + undef1829), jinit6^0 -> 0, jrev7^0 -> 1, len5^0 -> (0 + undef1847), n^0 -> undef1847}> Fresh variables: undef34, undef81, undef137, undef172, undef291, undef396, undef460, undef495, undef526, undef671, undef675, undef847, undef855, undef871, undef946, undef991, undef1049, undef1084, undef1201, undef1341, undef1440, undef1475, undef1507, undef1651, undef1655, undef1818, undef1829, undef1847, Undef variables: undef34, undef81, undef137, undef172, undef291, undef396, undef460, undef495, undef526, undef671, undef675, undef847, undef855, undef871, undef946, undef991, undef1049, undef1084, undef1201, undef1341, undef1440, undef1475, undef1507, undef1651, undef1655, undef1818, undef1829, undef1847, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef1341, j10^0 -> 1}> undef1341, j10^0 -> 1}> undef1341, init^0 -> 1, j10^0 -> 1}> undef1651, cword11^0 -> (0 + undef1829), i1114^0 -> 0, init^0 -> 1, j10^0 -> 0}> undef81, j24^0 -> (1 + j24^0)}> undef81, j24^0 -> (1 + j24^0)}> 1}> undef291, j24^0 -> 1}> undef396, j24^0 -> 1}> undef671, i1128^0 -> 0, j24^0 -> (1 + j24^0)}> undef460, i1128^0 -> (1 + i1128^0)}> undef495, i1128^0 -> (1 + i1128^0)}> undef1341, j10^0 -> 1}> undef1651, i1114^0 -> 0, j10^0 -> (1 + j10^0)}> undef1440, i1114^0 -> (1 + i1114^0)}> undef1475, i1114^0 -> (1 + i1114^0)}> undef396, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}> undef396, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}> undef396, init^0 -> 1, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}> undef671, cword25^0 -> (0 + undef847), i1128^0 -> 0, init^0 -> 1, j24^0 -> 0, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}> undef991, j10^0 -> (1 + j10^0)}> Fresh variables: undef34, undef81, undef137, undef172, undef291, undef396, undef460, undef495, undef526, undef671, undef675, undef847, undef855, undef871, undef946, undef991, undef1049, undef1084, undef1201, undef1341, undef1440, undef1475, undef1507, undef1651, undef1655, undef1818, undef1829, undef1847, Undef variables: undef34, undef81, undef137, undef172, undef291, undef396, undef460, undef495, undef526, undef671, undef675, undef847, undef855, undef871, undef946, undef991, undef1049, undef1084, undef1201, undef1341, undef1440, undef1475, undef1507, undef1651, undef1655, undef1818, undef1829, undef1847, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1651, i1114^0 -> 0, j10^0 -> 1 + j10^0, rest remain the same}> undef1440, i1114^0 -> 1 + i1114^0, rest remain the same}> undef1475, i1114^0 -> 1 + i1114^0, rest remain the same}> Variables: __const_255^0, __const_8^0, ans1215^0, i1114^0, j10^0 Graph 2: Transitions: undef991, j10^0 -> 1 + j10^0, rest remain the same}> Variables: cword11^0, j10^0, len5^0 Graph 3: Transitions: undef671, i1128^0 -> 0, j24^0 -> 1 + j24^0, rest remain the same}> undef460, i1128^0 -> 1 + i1128^0, rest remain the same}> undef495, i1128^0 -> 1 + i1128^0, rest remain the same}> Variables: __const_255^0, __const_8^0, ans1229^0, i1128^0, j24^0 Graph 4: Transitions: undef81, j24^0 -> 1 + j24^0, rest remain the same}> undef81, j24^0 -> 1 + j24^0, rest remain the same}> Variables: cword25^0, j24^0, jrev21^0, len19^0 Graph 5: Transitions: Variables: Precedence: Graph 0 Graph 1 undef1651, cword11^0 -> undef1829, i1114^0 -> 0, init^0 -> 1, j10^0 -> 0, rest remain the same}> Graph 2 undef1341, j10^0 -> 1, rest remain the same}> undef1341, j10^0 -> 1, rest remain the same}> undef1341, init^0 -> 1, j10^0 -> 1, rest remain the same}> undef1341, j10^0 -> 1, rest remain the same}> Graph 3 undef671, cword25^0 -> undef847, i1128^0 -> 0, init^0 -> 1, j24^0 -> 0, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}> Graph 4 1, rest remain the same}> undef291, j24^0 -> 1, rest remain the same}> undef396, j24^0 -> 1, rest remain the same}> undef396, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}> undef396, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}> undef396, init^0 -> 1, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}> Graph 5 Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 4 ) ( 11 , 3 ) ( 19 , 1 ) ( 22 , 2 ) ( 33 , 5 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004926 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001932s Ranking function: __const_255^0 - j10^0 New Graphs: Transitions: undef1440, i1114^0 -> 1 + i1114^0, rest remain the same}> undef1475, i1114^0 -> 1 + i1114^0, rest remain the same}> Variables: __const_8^0, ans1215^0, i1114^0 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001035s Ranking function: -1 + __const_8^0 - i1114^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001431 Checking conditional termination of SCC {l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000795s Ranking function: -j10^0 + len5^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.003787 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001929s Ranking function: __const_255^0 - j24^0 New Graphs: Transitions: undef460, i1128^0 -> 1 + i1128^0, rest remain the same}> undef495, i1128^0 -> 1 + i1128^0, rest remain the same}> Variables: __const_8^0, ans1229^0, i1128^0 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001047s Ranking function: -1 + __const_8^0 - i1128^0 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.00308 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001553s Ranking function: -2 - j24^0 - 2*jrev21^0 + len19^0 New Graphs: Transitions: undef81, j24^0 -> 1 + j24^0, rest remain the same}> Variables: cword25^0, j24^0, jrev21^0, len19^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000862s Ranking function: -j24^0 + len19^0 New Graphs: Proving termination of subgraph 5 Analyzing SCC {l33}... No cycles found. Program Terminates