/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_y, main_xtmp -> main_x}> 0}> 0}> main_y))> main_y)> (main_xtmp - main_y)}> main_xtmp, main_x -> main_tmp}> 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}> main_y, main_xtmp -> main_x}> 0}> 0}> main_y)> main_y))> (main_xtmp - main_y)}> main_xtmp, main_x -> main_tmp}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 20, 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 | | tmp | local variable | integer | | xtmp | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ (main_x <= 0), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x = main_y), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x < main_y), par{main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x > main_y), par{main_tmp -> main_y, main_xtmp -> main_x}> main_y), par{main_xtmp -> (main_xtmp - main_y)}> main_y)), par{main_x -> main_tmp, main_y -> main_xtmp}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 20, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 12 , 1 ) ( 20 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.034607 Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005259s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.042256s [22588 : 22589] [22588 : 22590] Successful child: 22589 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: -main_y + main_xtmp, rest remain the same}> Variables: main_y, main_tmp, main_xtmp Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000652s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002159s [22588 : 22594] [22588 : 22595] Successful child: 22594 [ 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_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001856s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036638s [22588 : 22599] [22588 : 22600] Successful child: 22599 [ 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001469s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011225s [22588 : 22604] [22588 : 22605] Successful child: 22604 [ 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x + main_y <= 1 - Process 1 * Exit transition: * Postcondition : main_x + main_y <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001407s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001507s INVARIANTS: 2: 12: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 1 , 12: main_y + main_tmp <= 0 , INVARIANTS: 12: 1 <= main_y + main_tmp , Quasi-INVARIANTS to narrow Graph: 12: LOG: CALL check - Post:0 <= main_x + main_y - Process 2 * Exit transition: * Postcondition : 0 <= main_x + main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001154s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001243s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x + main_y , [22588 : 22609] [22588 : 22610] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , main_y <= main_x , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004619s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.091497s [22588 : 22611] [22588 : 22612] Successful child: 22611 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002487s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.083597s [22588 : 22616] [22588 : 22617] Successful child: 22616 [ 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001708s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016298s [22588 : 22621] [22588 : 22622] Successful child: 22621 [ 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Ranking function: 22 - 23*main_x - 22*main_y New Graphs: [22588 : 22626] [22588 : 22627] INVARIANTS: 2: 12: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 1 , 12: 1 <= 0 , [22588 : 22628] [22588 : 22629] [22588 : 22630] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x + main_y , [22588 : 22631] [22588 : 22632] [22588 : 22633] [22588 : 22634] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x , main_x <= 1 + main_y , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009373s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.233172s [22588 : 22635] [22588 : 22636] Successful child: 22635 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003847s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.165724s [22588 : 22640] [22588 : 22641] Successful child: 22640 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002873s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.075716s [22588 : 22645] [22588 : 22646] Successful child: 22645 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002220s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024067s [22588 : 22650] [22588 : 22651] Successful child: 22650 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002838s Ranking function: main_x New Graphs: [22588 : 22655] [22588 : 22656] [22588 : 22657] INVARIANTS: 2: 12: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 1 , 12: main_y + main_tmp <= 0 , [22588 : 22658] [22588 : 22659] [22588 : 22660] [22588 : 22661] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 1 + main_x + main_y , LOG: CALL check - Post:1 + main_x + main_y <= 0 - Process 3 * Exit transition: * Postcondition : 1 + main_x + main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002684s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002824s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x + main_y <= 0 , [22588 : 22662] [22588 : 22663] [22588 : 22664] [22588 : 22665] [22588 : 22666] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , 0 <= 1 + main_x , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 5 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011191s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.299634s [22588 : 22667] [22588 : 22668] Successful child: 22667 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: main_y, main_xtmp -> 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: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005382s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.368644s [22588 : 22672] [22588 : 22673] Successful child: 22672 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004223s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.133739s [22588 : 22677] [22588 : 22678] Successful child: 22677 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003293s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.042713s [22588 : 22790] [22588 : 22791] Successful child: 22790 [ 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_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> 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: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002112s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012287s [22588 : 22795] [22588 : 22796] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022887s Time used: 0.022173 [22588 : 22800] [22588 : 22804] Successful child: 22804 Program does NOT terminate