/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_am -> main_a, main_bm -> main_b}> main_bm)> main_bm))> (main_bm + main_b)}> (main_am + main_a)}> 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, main_am -> main_a, main_bm -> main_b}> main_bm)> main_bm))> (main_bm + main_b)}> (main_am + main_a)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: 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, ()] | a | local variable | integer | | b | local variable | integer | | am | local variable | integer | | bm | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: main_bm)), par{main_am -> (main_am + main_a)}> main_bm) /\ (main_am > main_bm), par{main_bm -> (main_bm + main_b)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_am, main_bm, main_b Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 10 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005547 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001613s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003734s [23820 : 23821] [23820 : 23822] Successful child: 23821 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> Ranking function: 1 + main_a + main_b + main_am - main_bm New Graphs: Transitions: main_a + main_am, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000756s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002841s [23820 : 23826] [23820 : 23827] Successful child: 23826 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, 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_a + main_am, rest remain the same}> New Graphs: [23820 : 23831] [23820 : 23832] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 0 , main_am <= main_a + main_b + main_bm , LOG: CALL check - Post:main_b <= main_a - Process 1 * Exit transition: * Postcondition : main_b <= main_a LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000712s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000811s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a + main_bm <= main_b + main_am , main_b <= main_a , Narrowing transition: main_a + main_am, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_am, main_bm, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003970s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052172s [23820 : 23833] [23820 : 23834] Successful child: 23833 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003161s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052350s [23820 : 23838] [23820 : 23839] Successful child: 23838 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002167s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019141s Piecewise ranking function: min(0,2*main_a - 2*main_b - 2*main_am + 2*main_bm) New Graphs: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001543s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007536s [23820 : 23843] [23820 : 23844] Successful child: 23843 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000924s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003644s [23820 : 23848] [23820 : 23849] Successful child: 23848 [ 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_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 0 - Process 2 * Exit transition: * Postcondition : main_a <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001058s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001146s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 0 , [23820 : 23853] [23820 : 23854] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_b <= main_a , INVARIANTS: 2: main_a + main_bm <= main_b + main_am , Quasi-INVARIANTS to narrow Graph: 2: [23820 : 23855] [23820 : 23856] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_am <= main_bm , Narrowing transition: main_a + main_am, rest remain the same}> LOG: Narrow transition size 3 It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> Narrowing transition: main_a + main_am, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 3 It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_am, main_bm, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003324s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.048727s [23820 : 23857] [23820 : 23858] Successful child: 23857 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002288s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015103s [23820 : 23862] [23820 : 23863] Successful child: 23862 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000933s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003670s [23820 : 23867] [23820 : 23868] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011795s Time used: 0.011216 [23820 : 23872] [23820 : 23876] Successful child: 23872 Program does NOT terminate