/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = arg2), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 2}> 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = arg2), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 1}> = undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = undef14), par{arg1 -> undef1, arg2 -> undef2}> 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = undef14), par{arg1 -> undef4, arg2 -> undef5}> = undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> Fresh variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef7, arg2 -> undef8, rest remain the same}> undef10, arg2 -> undef11, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 undef1, arg2 -> undef2, rest remain the same}> undef4, arg2 -> undef5, 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.006117 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001893s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009995s [4262 : 4263] [4262 : 4264] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018353s Time used: 0.017175 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef1, arg2 -> undef2, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef1, arg2 -> undef2, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001567s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001695s Cannot prove unreachability [4262 : 4268] [4262 : 4269] Successful child: 4268 Program does NOT terminate