/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES 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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int), main_tx -> ¿functionCall(__VERIFIER_nondet_int)}> = main_y))> = main_y)> (main_z - 1), main_tx -> main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> (main_y + 1)}> 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4}> = main_y)> = main_y))> ¿functionCall(__VERIFIER_nondet_int)}> (main_z - 1), main_tx -> main_x}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_6}> (main_y + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 11, 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, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | tx | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = main_y) /\ (main_x <= (main_tx + main_z)) /\ (undef11 = 0), par{main_y -> (main_y + 1)}> = main_y) /\ (main_x <= (main_tx + main_z)) /\ (undef11 = 1), par{main_x -> undef12, main_z -> (main_z - 1), main_tx -> main_x}> = main_y) /\ not((main_x <= (main_tx + main_z)))> = main_y))> Fresh variables: undef7, undef8, undef9, undef10, undef11, undef12, Undef variables: undef7, undef8, undef9, undef10, undef11, undef12, Abstraction variables: Exit nodes: 11, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_y, rest remain the same}> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 11 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005863 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001846s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009013s [39375 : 39376] [39375 : 39377] Successful child: 39376 [ 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: 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= main_y - Process 1 * Exit transition: * Postcondition : 1 + main_x <= main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000720s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000849s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= main_y , Narrowing transition: 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_y, rest remain the same}> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001770s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009243s [39375 : 39381] [39375 : 39382] Successful child: 39381 [ 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: 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, 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: 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_z + main_tx <= main_y - Process 2 * Exit transition: * Postcondition : 1 + main_z + main_tx <= main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000907s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001034s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_z + main_tx <= main_y , Narrowing transition: 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_y, rest remain the same}> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001559s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009650s [39375 : 39386] [39375 : 39387] Successful child: 39386 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef12, main_z -> -1 + main_z, main_tx -> main_x, 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): 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Ranking function: -main_y + main_z + main_tx New Graphs: Transitions: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000929s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003676s [39375 : 39391] [39375 : 39392] Successful child: 39391 [ 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: 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_z <= 1 - Process 3 * Exit transition: * Postcondition : main_z <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000920s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001053s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_z <= 1 , LOG: CALL check - Post:1 + main_z + main_tx <= main_x - Process 4 * Exit transition: * Postcondition : 1 + main_z + main_tx <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000802s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000934s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_z + main_tx <= main_x , Narrowing transition: 1 + main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_y, rest remain the same}> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001610s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009755s [39375 : 39396] [39375 : 39397] Successful child: 39396 [ 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: 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_z + main_tx <= main_x - Process 5 * Exit transition: * Postcondition : 1 + main_z + main_tx <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000783s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000933s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_z + main_tx <= main_x , Narrowing transition: 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_y, rest remain the same}> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001602s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009406s [39375 : 39401] [39375 : 39402] Successful child: 39401 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef12, main_z -> -1 + main_z, main_tx -> main_x, 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): 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Ranking function: -main_y + main_z + main_tx New Graphs: Transitions: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000920s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003668s [39375 : 39406] [39375 : 39407] Successful child: 39406 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef12, main_z -> -1 + main_z, main_tx -> main_x, 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): undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Ranking function: -main_y + main_z + main_tx New Graphs: LOG: CALL check - Post:main_z <= 1 - Process 6 * Exit transition: * Postcondition : main_z <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000774s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000919s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_z <= 1 , INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_z <= 0 , Narrowing transition: 1 + main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_y, rest remain the same}> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002465s Ranking function: 1 + main_z New Graphs: Transitions: 1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z, main_tx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001277s Ranking function: main_x - main_y New Graphs: Proving termination of subgraph 2 Analyzing SCC {l11}... No cycles found. Program Terminates