/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: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}> 0, arg2 -> undef11}> ~(1)) /\ (arg2 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (arg1 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19), arg2 -> undef18}> 1), par{arg1 -> (arg1 - 2), arg2 -> undef23}> (arg1 - 2), arg2 -> undef25}> undef26, arg2 -> undef27}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef27 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef26 > 0) /\ (undef6 > ~(1)) /\ (undef27 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef26 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef27 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef26 > 0) /\ (undef19 > ~(1)) /\ (undef27 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (undef26 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19)}> ~(1)) /\ (undef27 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef26 > 0) /\ (undef6 > ~(1)) /\ (undef27 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef26 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef27 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef26 > 0) /\ (undef19 > ~(1)) /\ (undef27 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (undef26 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19)}> 0}> 1), par{arg1 -> (arg1 - 2)}> (arg1 - 2)}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Graph 2: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 undef6, rest remain the same}> undef6, rest remain the same}> Graph 2 -undef19, rest remain the same}> -undef19, rest remain the same}> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002518 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000578s Ranking function: -1 + (1 / 2)*arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.002224 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000455s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001110s [16586 : 16587] [16586 : 16588] Successful child: 16587 [ 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: -2 + arg1, 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: -2 + arg1, rest remain the same}> New Graphs: [16586 : 16592] [16586 : 16593] INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: 0 <= arg1 , Narrowing transition: -2 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000388s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001178s [16586 : 16594] [16586 : 16595] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006511s Time used: 0.006185 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016158s Time used: 0.016152 LOG: SAT solveNonLinear - Elapsed time: 0.022669s Cost: 1; Total time: 0.022337 Termination implied by a set of invariant(s): Invariant at l4: 1 + arg1 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -2 + arg1, 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): -2 + arg1, rest remain the same}> Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000389s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001179s [16586 : 16599] [16586 : 16600] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005950s Time used: 0.00568 [16586 : 16604] [16586 : 16608] Successful child: 16604 Program does NOT terminate