/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ ((undef2 - 1) <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 1), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 0, arg4 -> (arg2 + 1), arg5 -> 0, arg6 -> arg2}> arg3) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg5 < undef11) /\ (arg1 >= undef7) /\ (arg2 >= undef7) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> undef11}> ~(1)) /\ (arg4 > arg3) /\ (undef13 <= arg1) /\ ((undef13 + 1) <= arg2) /\ ((undef14 - 3) <= arg1) /\ ((undef14 - 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef13 > 0) /\ (undef14 > 3), par{arg1 -> undef13, arg2 -> undef14, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> 1}> 0) /\ (undef19 > 0), par{arg1 -> undef19, arg2 -> (arg2 + 1), arg4 -> undef22, arg5 -> undef23, arg6 -> undef24}> 0) /\ (arg2 > 1) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30}> 0) /\ (arg4 <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef31 > 0), par{arg1 -> undef31, arg2 -> arg5, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> arg5}> 0) /\ (arg4 > 0) /\ (undef41 > arg5) /\ (arg5 < arg3) /\ (arg3 > 0) /\ (undef40 < arg4) /\ (arg5 < arg2) /\ (arg1 > 2) /\ (undef37 > 0), par{arg1 -> undef37, arg4 -> undef40, arg5 -> undef41, arg6 -> undef42}> ~(1)) /\ (arg3 > ~(1)) /\ (undef46 < arg3) /\ (arg1 > 2) /\ (undef43 > 0) /\ (arg1 >= (undef49 + 3)) /\ (arg2 = arg6), par{arg1 -> undef43, arg2 -> undef44, arg3 -> 0, arg4 -> undef46, arg5 -> 1, arg6 -> undef48}> undef50, arg2 -> undef51, arg3 -> undef52, arg4 -> undef53, arg5 -> undef54, arg6 -> undef55}> Fresh variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, Undef variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ ((undef2 - 1) <= undef50) /\ (undef50 > 0) /\ (undef1 > 0) /\ (undef2 > 1)> arg3) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg5 < undef11) /\ (arg1 >= undef7) /\ (arg2 >= undef7) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> undef11}> ~(1)) /\ (arg4 > arg3) /\ (undef13 <= arg1) /\ ((undef13 + 1) <= arg2) /\ ((undef14 - 3) <= arg1) /\ ((undef14 - 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef13 > 0) /\ (undef14 > 3), par{arg1 -> undef13, arg2 -> undef14, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> 1}> 0) /\ (arg2 > 1) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30}> 0) /\ (arg4 <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef31 > 0), par{arg1 -> undef31, arg2 -> arg5, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> arg5}> 0) /\ (undef19 > 0), par{arg1 -> undef19, arg2 -> (arg2 + 1), arg4 -> undef22, arg5 -> undef23, arg6 -> undef24}> 0) /\ (arg4 > 0) /\ (undef41 > arg5) /\ (arg5 < arg3) /\ (arg3 > 0) /\ (undef40 < arg4) /\ (arg5 < arg2) /\ (arg1 > 2) /\ (undef37 > 0), par{arg1 -> undef37, arg4 -> undef40, arg5 -> undef41, arg6 -> undef42}> ~(1)) /\ (arg3 > ~(1)) /\ (undef46 < arg3) /\ (arg1 > 2) /\ (undef43 > 0) /\ (arg1 >= (undef49 + 3)) /\ (arg2 = arg6), par{arg1 -> undef43, arg2 -> undef44, arg3 -> 0, arg4 -> undef46, arg5 -> 1, arg6 -> undef48}> Fresh variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, Undef variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef7, arg2 -> undef8, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> undef11, rest remain the same}> undef13, arg2 -> undef14, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> 1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Graph 2: Transitions: undef37, arg4 -> undef40, arg5 -> undef41, arg6 -> undef42, rest remain the same}> undef43, arg2 -> undef44, arg3 -> 0, arg4 -> undef46, arg5 -> 1, arg6 -> undef48, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Graph 3: Transitions: undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> Variables: arg1, arg2, arg4, arg5, arg6 Precedence: Graph 0 Graph 1 Graph 2 undef31, arg2 -> arg5, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> arg5, rest remain the same}> Graph 3 undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 3 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.016686 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003045s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018701s [61421 : 61423] [61421 : 61424] Successful child: 61423 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, arg2 -> undef8, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> undef11, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef13, arg2 -> undef14, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, arg2 -> undef8, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> undef11, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef13, arg2 -> undef14, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> 1, rest remain the same}> Ranking function: -arg3 + arg6 New Graphs: INVARIANTS: 2: arg4 <= 1 + arg6 , Quasi-INVARIANTS to narrow Graph: 2: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.012813 Some transition disabled by a set of invariant(s): Invariant at l4: arg3 <= arg5 Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef37, arg4 -> undef40, arg5 -> undef41, arg6 -> undef42, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef43, arg2 -> undef44, arg3 -> 0, arg4 -> undef46, arg5 -> 1, arg6 -> undef48, rest remain the same}> Checking unfeasibility... Time used: 0.004612 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002030s Ranking function: arg6 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.003475 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000862s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002629s [61421 : 61433] [61421 : 61434] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014467s Time used: 0.01399 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000506s Time used: 1.00041 LOG: SAT solveNonLinear - Elapsed time: 1.014973s Cost: 1; Total time: 1.0144 Termination implied by a set of invariant(s): Invariant at l3: 0 <= arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> Variables: arg1, arg2, arg4, arg5, arg6 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000893s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003207s [61421 : 61455] [61421 : 61456] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016556s Time used: 0.015765 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.011730s Time used: 1.01165 LOG: SAT solveNonLinear - Elapsed time: 1.028286s Cost: 1; Total time: 1.02742 Termination implied by a set of invariant(s): Invariant at l3: 1 <= arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> Quasi-ranking function: 50000 + 50000*arg1 - arg2 New Graphs: Transitions: undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> Variables: arg1, arg2, arg4, arg5, arg6 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000996s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004591s [61421 : 61484] [61421 : 61485] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102312s Time used: 4.10095 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001344s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001525s LOG: NarrowEntry size 1 Narrowing transition: undef7, arg2 -> undef8, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> undef11, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef13, arg2 -> undef14, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> 1, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef7, arg2 -> undef8, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> undef11, rest remain the same}> undef13, arg2 -> undef14, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> 1, rest remain the same}> END GRAPH: EXIT: undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [61421 : 61652] [61421 : 61653] [61421 : 61654] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 1.996195s Cannot prove unreachability [61421 : 61677] [61421 : 61679] Successful child: 61677 Program does NOT terminate