/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0}> ~(1)) /\ (arg1 > 0) /\ (undef7 > 0) /\ (1 = arg2), par{arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1}> ~(1)) /\ (arg2 > 1) /\ (undef14 > ~(1)) /\ (undef13 <= arg1) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> arg2, arg5 -> 2, arg6 -> arg2}> = arg4) /\ (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0) /\ (arg4 = arg6), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1), arg6 -> arg4}> 0) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef31 > ~(1)) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0) /\ (arg4 = arg6), par{arg1 -> undef25, arg2 -> ((arg2 - 1) - undef31), arg3 -> ((arg2 - 1) - undef31), arg5 -> (arg5 + 1), arg6 -> arg4}> undef32, arg2 -> undef33, arg3 -> undef34, arg4 -> undef35, arg5 -> undef36, arg6 -> undef37}> Fresh variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (0 = undef33), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0}> ~(1)) /\ (undef32 > 0) /\ (undef7 > 0) /\ (1 = undef33), par{arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1}> ~(1)) /\ (undef33 > 1) /\ (undef14 > ~(1)) /\ (undef13 <= undef32) /\ (undef32 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33}> = arg4) /\ (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0) /\ (arg4 = arg6), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1), arg6 -> arg4}> 0) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef31 > ~(1)) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0) /\ (arg4 = arg6), par{arg1 -> undef25, arg2 -> ((arg2 - 1) - undef31), arg3 -> ((arg2 - 1) - undef31), arg5 -> (arg5 + 1), arg6 -> arg4}> Fresh variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Precedence: Graph 0 Graph 1 undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, rest remain the same}> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1, rest remain the same}> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.011931 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002930s Ranking function: -4 + 4*arg4 - 4*arg5 New Graphs: Transitions: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001060s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004391s [30137 : 30138] [30137 : 30139] Successful child: 30138 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> New Graphs: LOG: CALL check - Post:arg3 + arg6 <= arg4 - Process 1 * Exit transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33, rest remain the same}> * Postcondition : arg3 + arg6 <= arg4 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000711s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000853s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg3 + arg6 <= arg4 , arg6 <= 1 + arg2 + arg4 , Narrowing transition: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003068s Ranking function: -4 + 4*arg4 - 4*arg5 New Graphs: Transitions: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001156s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004821s [30137 : 30143] [30137 : 30144] Successful child: 30143 [ 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, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, 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, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> Ranking function: -arg2 + arg3 New Graphs: LOG: CALL check - Post:arg2 + arg5 <= arg4 - Process 2 * Exit transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33, rest remain the same}> * Postcondition : arg2 + arg5 <= arg4 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000657s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000811s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 + arg5 <= arg4 , Narrowing transition: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003566s Ranking function: -1 + arg4 - arg5 New Graphs: Transitions: undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001688s Ranking function: -1 + arg2 - arg4 + arg5 New Graphs: Program Terminates