/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> (main_x + main_y), main_y -> (main_y + main_z), 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.002386 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000617s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001650s [17288 : 17289] [17288 : 17290] Successful child: 17289 [ 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.000549s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000642s 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.000574s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001764s [17288 : 17294] [17288 : 17295] Successful child: 17294 [ 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.000625s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000724s 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.000577s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001737s [17288 : 17299] [17288 : 17300] Successful child: 17299 [ 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: [17288 : 17304] [17288 : 17305] 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.001152s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007907s 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.000606s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002078s [17288 : 17306] [17288 : 17307] Successful child: 17306 [ 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: [17288 : 17311] [17288 : 17312] [17288 : 17313] 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.001279s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008046s 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.000606s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002113s [17288 : 17314] [17288 : 17315] Successful child: 17314 [ 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: [17288 : 17319] [17288 : 17320] 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.002920s 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.001372s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018974s 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.000730s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002617s [17288 : 17321] [17288 : 17322] Successful child: 17321 [ 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: [17288 : 17326] [17288 : 17327] [17288 : 17328] [17288 : 17329] 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.005137s 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.002349s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.078520s 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.001580s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019338s [17288 : 17330] [17288 : 17331] Successful child: 17330 [ 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.000948s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005240s [17288 : 17335] [17288 : 17336] Successful child: 17335 [ 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: [17288 : 17340] [17288 : 17341] [17288 : 17342] [17288 : 17343] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= main_z , [17288 : 17344] [17288 : 17345] [17288 : 17346] 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.012579s 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.003608s 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.000933s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003898s [17288 : 17347] [17288 : 17348] Successful child: 17347 [ 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: [17288 : 17352] [17288 : 17353] [17288 : 17354] [17288 : 17355] [17288 : 17356] [17288 : 17357] [17288 : 17358] [17288 : 17359] 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.017939s 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.003556s 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.004258s [17288 : 17360] [17288 : 17361] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046626s Time used: 0.045638 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.083520s Time used: 0.083507 LOG: SAT solveNonLinear - Elapsed time: 0.130147s Cost: 1; Total time: 0.129145 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.001113s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009093s [17288 : 17365] [17288 : 17366] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044959s Time used: 0.043802 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.075203s Time used: 0.075191 LOG: SAT solveNonLinear - Elapsed time: 0.120163s Cost: 1; Total time: 0.118993 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.001303s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006742s [17288 : 17370] [17288 : 17371] Successful child: 17370 [ 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: [17288 : 17375] [17288 : 17376] [17288 : 17377] [17288 : 17378] [17288 : 17379] [17288 : 17380] [17288 : 17381] [17288 : 17382] 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.018008s 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.003741s 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.001002s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004339s [17288 : 17383] [17288 : 17384] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042251s Time used: 0.04103 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.069075s Time used: 0.069064 LOG: SAT solveNonLinear - Elapsed time: 0.111326s Cost: 1; Total time: 0.110094 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.001133s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009242s [17288 : 17389] [17288 : 17390] Successful child: 17389 [ 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: [17288 : 17394] [17288 : 17395] [17288 : 17396] [17288 : 17397] [17288 : 17398] [17288 : 17399] [17288 : 17400] [17288 : 17401] 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.042734s 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.005820s 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.003090s 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.001107s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004326s [17288 : 17402] [17288 : 17403] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.057220s Time used: 0.055837 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.114803s Time used: 0.114787 LOG: SAT solveNonLinear - Elapsed time: 0.172023s Cost: 1; Total time: 0.170624 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.001260s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006377s [17288 : 17442] [17288 : 17443] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062705s Time used: 0.06116 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.096583s Time used: 0.096569 LOG: SAT solveNonLinear - Elapsed time: 0.159288s Cost: 1; Total time: 0.157729 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.001322s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006996s [17288 : 17447] [17288 : 17448] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.073770s Time used: 0.072167 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.111480s Time used: 0.111464 LOG: SAT solveNonLinear - Elapsed time: 0.185249s Cost: 1; Total time: 0.183631 Quasi-ranking function: 50000 + 2*main_x - 2*main_y 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.001357s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040461s [17288 : 17452] [17288 : 17453] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060932s Time used: 0.058966 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.115388s Time used: 0.115372 LOG: SAT solveNonLinear - Elapsed time: 0.176321s Cost: 1; Total time: 0.174338 Quasi-ranking function: 50000 + main_x + main_y - 2*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.001669s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.055172s [17288 : 17618] [17288 : 17619] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070746s Time used: 0.069174 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.107078s Time used: 0.107063 LOG: SAT solveNonLinear - Elapsed time: 0.177824s Cost: 1; Total time: 0.176237 Quasi-ranking function: 50000 + main_x - 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.001526s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046403s [17288 : 17881] [17288 : 17882] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061718s Time used: 0.06012 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.089183s Time used: 0.089163 LOG: SAT solveNonLinear - Elapsed time: 0.150901s Cost: 1; Total time: 0.149283 Quasi-ranking function: 50000 - 4*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.002305s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.137636s [17288 : 17886] [17288 : 17887] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059952s Time used: 0.058312 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.115309s Time used: 0.115293 LOG: SAT solveNonLinear - Elapsed time: 0.175261s Cost: 1; Total time: 0.173605 Quasi-ranking function: 50000 + main_x - 4*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.002049s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.149270s [17288 : 18004] [17288 : 18005] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062525s Time used: 0.060879 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.099738s Time used: 0.099721 LOG: SAT solveNonLinear - Elapsed time: 0.162263s Cost: 1; Total time: 0.1606 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.002084s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.069715s [17288 : 18409] [17288 : 18410] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.073123s Time used: 0.071235 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074348s Time used: 0.074335 LOG: SAT solveNonLinear - Elapsed time: 0.147471s Cost: 1; Total time: 0.14557 Quasi-ranking function: 50000 - 2*main_x + 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.002216s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.061786s [17288 : 18414] [17288 : 18415] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069085s Time used: 0.066807 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.117921s Time used: 0.117897 LOG: SAT solveNonLinear - Elapsed time: 0.187006s Cost: 1; Total time: 0.184704 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.003049s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.168788s [17288 : 18419] [17288 : 18420] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079675s Time used: 0.077225 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.121277s Time used: 0.121254 LOG: SAT solveNonLinear - Elapsed time: 0.200952s Cost: 1; Total time: 0.198479 Quasi-ranking function: 50000 - 2*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.003185s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.198768s [17288 : 18637] [17288 : 18638] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.072116s Time used: 0.069681 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091341s Time used: 0.091327 LOG: SAT solveNonLinear - Elapsed time: 0.163457s Cost: 1; Total time: 0.161008 Quasi-ranking function: 50000 - 2*main_x + main_y 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.002309s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.111447s [17288 : 19158] [17288 : 19159] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071375s Time used: 0.068749 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.118736s Time used: 0.118584 LOG: SAT solveNonLinear - Elapsed time: 0.190110s Cost: 1; Total time: 0.187333 Quasi-ranking function: 50000 - 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.002473s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.090469s [17288 : 19163] [17288 : 19164] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064792s Time used: 0.062108 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.096974s Time used: 0.09696 LOG: SAT solveNonLinear - Elapsed time: 0.161767s Cost: 1; Total time: 0.159068 Quasi-ranking function: 50000 - 2*main_x + 2*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.002606s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.228479s [17288 : 19188] [17288 : 19189] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064667s Time used: 0.061773 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.113819s Time used: 0.113791 LOG: SAT solveNonLinear - Elapsed time: 0.178485s Cost: 1; Total time: 0.175564 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.002747s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.385206s [17288 : 19591] [17288 : 19592] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.081029s Time used: 0.07808 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.144184s Time used: 0.144165 LOG: SAT solveNonLinear - Elapsed time: 0.225213s Cost: 1; Total time: 0.222245 Quasi-ranking function: 50000 - main_y 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.002783s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.075367s [17288 : 19596] [17288 : 19597] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069654s Time used: 0.066601 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.083809s Time used: 0.083796 LOG: SAT solveNonLinear - Elapsed time: 0.153463s Cost: 1; Total time: 0.150397 Quasi-ranking function: 50000 - 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.003269s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.139627s [17288 : 19601] [17288 : 19602] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.072491s Time used: 0.069588 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.090725s Time used: 0.090711 LOG: SAT solveNonLinear - Elapsed time: 0.163216s Cost: 1; Total time: 0.160299 Quasi-ranking function: 50000 - main_x - main_y 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.003155s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.109295s [17288 : 19844] [17288 : 19845] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.075770s Time used: 0.072944 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.115295s Time used: 0.115279 LOG: SAT solveNonLinear - Elapsed time: 0.191065s Cost: 1; Total time: 0.188223 Quasi-ranking function: 50000 - main_x - 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.003288s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.103855s [17288 : 19937] [17288 : 19938] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068253s Time used: 0.066251 [17288 : 20082] [17288 : 20097] Successful child: 20082 Program does NOT terminate