/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_n -> ¿functionCall(__VERIFIER_nondet_int), main_i -> 0, main_j -> 1, main_t -> 0}> (main_j + main_i), main_i -> main_j, main_j -> main_t}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1, main_i -> 0, main_j -> 1, main_t -> 0}> (main_j + main_i), main_i -> main_j, main_j -> main_t}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | n | local variable | integer | | i | local variable | integer | | j | local variable | integer | | t | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: main_j, main_j -> (main_j + main_i)}> main_n), par{main_i -> main_j, main_j -> (main_j + main_i)}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004116 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001393s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003827s [25664 : 25666] [25664 : 25667] Successful child: 25666 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, 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): main_j, main_j -> main_i + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, rest remain the same}> Ranking function: 3*main_n - main_i - 2*main_j New Graphs: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000758s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003644s [25664 : 25679] [25664 : 25680] Successful child: 25679 [ 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: main_j, main_j -> main_i + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i + main_j, 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: main_j, main_j -> main_i + main_j, rest remain the same}> New Graphs: INVARIANTS: 2: main_i <= main_j , 0 <= main_i , 1 <= main_i + main_j , Quasi-INVARIANTS to narrow Graph: 2: [25664 : 25689] [25664 : 25690] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_j <= main_n + main_i , main_i <= 0 , main_n <= 1 + main_i , Narrowing transition: main_j, main_j -> main_i + main_j, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_j, main_j -> main_i + main_j, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> main_j, main_j -> main_i + main_j, rest remain the same}> main_j, main_j -> main_i + main_j, rest remain the same}> main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003897s Ranking function: 3 - 8*main_i New Graphs: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> main_j, main_j -> main_i + main_j, rest remain the same}> main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002607s Ranking function: 7 + 6*main_n - 2*main_i - 4*main_j New Graphs: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001468s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011152s [25664 : 25691] [25664 : 25692] Successful child: 25691 [ 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: main_j, main_j -> main_i + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000923s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003969s [25664 : 25696] [25664 : 25697] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015331s Time used: 0.014679 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001969s Time used: 1.00193 LOG: SAT solveNonLinear - Elapsed time: 1.017300s Cost: 1; Total time: 1.01661 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_i [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, 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): main_j, main_j -> main_i + main_j, rest remain the same}> Quasi-ranking function: 50000 - main_i - main_j New Graphs: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000941s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004216s [25664 : 25866] [25664 : 25867] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016176s Time used: 0.01542 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001277s Time used: 1.0011 LOG: SAT solveNonLinear - Elapsed time: 1.017452s Cost: 1; Total time: 1.01652 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_j [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, 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): main_j, main_j -> main_i + main_j, rest remain the same}> Quasi-ranking function: 50000 - 2*main_n - main_i - main_j New Graphs: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001061s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007701s [25664 : 25871] [25664 : 25872] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016180s Time used: 0.015328 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001003s Time used: 1.00095 LOG: SAT solveNonLinear - Elapsed time: 1.017183s Cost: 1; Total time: 1.01628 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_i [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i + main_j, 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): main_j, main_j -> main_i + main_j, rest remain the same}> Quasi-ranking function: 50000 + main_n - main_i - main_j New Graphs: Transitions: main_j, main_j -> main_i + main_j, rest remain the same}> Variables: main_n, main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001172s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007970s [25664 : 26416] [25664 : 26417] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102237s Time used: 4.10102 [25664 : 26421] [25664 : 26424] Successful child: 26424 Program does NOT terminate