NO Solver Timeout: 4 Global Timeout: 60 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), main_z -> (main_z + main_x)}> 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), main_z -> (main_z + main_x)}> 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), main_z -> (main_z + (main_x + main_y))}> 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, main_z -> main_x + 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.00242 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000626s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001678s [16677 : 16679] [16677 : 16680] Successful child: 16679 [ 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000564s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000663s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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.000588s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001796s [16677 : 16684] [16677 : 16685] Successful child: 16684 [ 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 2 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000636s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000740s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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.000590s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001788s [16677 : 16689] [16677 : 16690] Successful child: 16689 [ 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> Ranking function: main_x New Graphs: [16677 : 16694] [16677 : 16695] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 0 , main_x + main_z <= 2 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001187s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008312s Piecewise ranking function: min(0,-3 + 3*main_x) New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.000613s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002102s [16677 : 16696] [16677 : 16697] Successful child: 16696 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: [16677 : 16702] [16677 : 16703] [16677 : 16704] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 0 , main_x + main_y + main_z <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001306s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008432s Piecewise ranking function: min(0,-3 + 3*main_x) New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.000620s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002132s [16677 : 16705] [16677 : 16706] Successful child: 16705 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> Ranking function: 3*main_x + 2*main_y + main_z New Graphs: [16677 : 16710] [16677 : 16711] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , main_y <= 1 + main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.003000s Ranking function: -5 + 3*main_x - 3*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001478s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019464s Piecewise ranking function: min(0,-1 + main_x) New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.000736s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002651s [16677 : 16712] [16677 : 16713] Successful child: 16712 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: [16677 : 16718] [16677 : 16719] [16677 : 16720] [16677 : 16721] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x + main_y <= main_z , main_z <= 1 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.005300s Ranking function: -5 + 6*main_x - 6*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.002377s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.079661s Piecewise ranking function: min((~(9) / 2) + 7*main_x,(5 / 2)) New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001616s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019793s [16677 : 16722] [16677 : 16723] Successful child: 16722 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> Ranking function: -main_x - main_y + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.000972s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005271s [16677 : 16728] [16677 : 16729] Successful child: 16728 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: [16677 : 16733] [16677 : 16734] [16677 : 16735] [16677 : 16736] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= main_z , [16677 : 16737] [16677 : 16738] [16677 : 16739] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 1 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.012919s Ranking function: 8*main_x - 8*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.003670s Ranking function: -8 - 8*main_x - 8*main_y + 8*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.000937s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003925s [16677 : 16740] [16677 : 16741] Successful child: 16740 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: [16677 : 16748] [16677 : 16749] [16677 : 16750] [16677 : 16751] [16677 : 16752] [16677 : 16753] [16677 : 16754] [16677 : 16755] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_z , main_x + main_y + main_z <= 1 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.018696s Ranking function: 9*main_x - 9*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.003609s Ranking function: -9 - 9*main_x - 9*main_y + 9*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.000999s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004333s [16677 : 16756] [16677 : 16757] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052414s Time used: 0.051391 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.096438s Time used: 0.096429 LOG: SAT solveNonLinear - Elapsed time: 0.148852s Cost: 1; Total time: 0.14782 Quasi-ranking function: 50000 - main_x - main_y + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001122s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009153s [16677 : 16765] [16677 : 16766] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049292s Time used: 0.047995 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.082689s Time used: 0.082681 LOG: SAT solveNonLinear - Elapsed time: 0.131981s Cost: 1; Total time: 0.130676 Quasi-ranking function: 50000 + main_y - main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001320s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006782s [16677 : 16773] [16677 : 16774] Successful child: 16773 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: [16677 : 16781] [16677 : 16782] [16677 : 16783] [16677 : 16784] [16677 : 16785] [16677 : 16786] [16677 : 16787] [16677 : 16788] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , main_y <= 1 + main_x + main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.018447s Ranking function: 9*main_x - 9*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.003777s Ranking function: -9 - 9*main_x - 9*main_y + 9*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001011s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004412s [16677 : 16789] [16677 : 16790] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045942s Time used: 0.044554 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.078327s Time used: 0.078319 LOG: SAT solveNonLinear - Elapsed time: 0.124269s Cost: 1; Total time: 0.122873 Quasi-ranking function: 50000 - main_x - main_y + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001128s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009251s [16677 : 16950] [16677 : 16951] Successful child: 16950 [ 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> New Graphs: [16677 : 17078] [16677 : 17079] [16677 : 17081] [16677 : 17082] [16677 : 17083] [16677 : 17084] [16677 : 17085] [16677 : 17086] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_y <= main_z , main_x + main_y + main_z <= 1 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + 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, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.043802s Ranking function: 9*main_x - 9*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.005935s Ranking function: -9 - 11*main_x - 11*main_y + 11*main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.003123s Ranking function: 1 + main_y - main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> main_x + 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.001113s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004377s [16677 : 17088] [16677 : 17089] Timeout expired! [16677 : 17150] [16677 : 17154] Successful child: 17154 Program does NOT terminate