/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> (main_x + main_y), main_y -> (main_y + main_z)}> 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}> 0)> 0))> (main_x + main_y), main_y -> (main_y + main_z)}> 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 [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z)}> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z 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.002348 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000818s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001806s [32934 : 32935] [32934 : 32936] Successful child: 32935 [ 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 1 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000546s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000639s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000770s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001915s [32934 : 32940] [32934 : 32941] Successful child: 32940 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> Ranking function: main_x New Graphs: [32934 : 32945] [32934 : 32946] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= main_z , main_x + main_y + main_z <= 1 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001098s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005727s [32934 : 32947] [32934 : 32948] Successful child: 32947 [ 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000706s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002579s [32934 : 32952] [32934 : 32953] Successful child: 32952 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> Ranking function: main_x - main_z New Graphs: [32934 : 32957] [32934 : 32958] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , LOG: CALL check - Post:main_x <= 1 + main_z - Process 2 * Exit transition: * Postcondition : main_x <= 1 + main_z LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000857s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000989s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 1 + main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001656s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014524s [32934 : 32959] [32934 : 32960] Successful child: 32959 [ 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000720s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002699s [32934 : 32964] [32934 : 32965] Successful child: 32964 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> Ranking function: 2*main_x New Graphs: LOG: CALL check - Post:main_x + main_y + main_z <= 0 - Process 3 * Exit transition: * Postcondition : main_x + main_y + main_z <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000717s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000864s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , [32934 : 32969] [32934 : 32970] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001749s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014235s [32934 : 32971] [32934 : 32972] Successful child: 32971 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001384s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006899s [32934 : 32976] [32934 : 32977] Successful child: 32976 [ 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000747s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002719s [32934 : 32981] [32934 : 32982] Successful child: 32981 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> Ranking function: main_x New Graphs: LOG: CALL check - Post:0 <= main_z - Process 4 * Exit transition: * Postcondition : 0 <= main_z LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000889s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001018s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_z , [32934 : 32986] [32934 : 32987] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_z <= 0 , [32934 : 32988] [32934 : 32989] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_y + main_z <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003092s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041413s [32934 : 32990] [32934 : 32991] Successful child: 32990 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002006s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012626s [32934 : 32998] [32934 : 32999] Successful child: 32998 [ 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, 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_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000834s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002995s [32934 : 33004] [32934 : 33005] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010301s Time used: 0.00986 [32934 : 33155] [32934 : 33159] Successful child: 33155 Program does NOT terminate