/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0)}> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0)}> 1, n^0 -> undef25}> Fresh variables: undef25, Undef variables: undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0)}> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0)}> Fresh variables: undef25, Undef variables: undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, e^0, n^0, __const_10^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007366 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001726s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006627s [5440 : 5441] [5440 : 5442] Successful child: 5441 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: 2 + 2*__const_100^0 - __const_10^0 - __const_11^0 - 2*n^0 New Graphs: Transitions: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001193s Ranking function: -1 + e^0 New Graphs: [5440 : 5446] [5440 : 5447] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= __const_11^0 , __const_10^0 + __const_11^0 <= 1 , Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, e^0, n^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002417s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036357s [5440 : 5448] [5440 : 5449] Successful child: 5448 [ 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001759s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008979s [5440 : 5453] [5440 : 5454] Successful child: 5453 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Ranking function: -__const_100^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000810s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003208s [5440 : 5458] [5440 : 5459] Successful child: 5458 [ 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> New Graphs: LOG: CALL check - Post:__const_11^0 <= 0 - Process 1 * Exit transition: * Postcondition : __const_11^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000663s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000787s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_11^0 <= 0 , LOG: CALL check - Post:1 <= __const_10^0 + __const_11^0 - Process 2 * Exit transition: * Postcondition : 1 <= __const_10^0 + __const_11^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001050s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001143s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= __const_10^0 + __const_11^0 , [5440 : 5463] [5440 : 5464] [5440 : 5465] [5440 : 5466] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_100^0 + __const_10^0 + e^0 <= 1 + n^0 , __const_10^0 + __const_11^0 + n^0 <= 1 + __const_100^0 + e^0 , Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, e^0, n^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005763s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.405446s [5440 : 5467] [5440 : 5468] Successful child: 5467 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003850s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.272340s [5440 : 5472] [5440 : 5473] Successful child: 5473 Ranking function: -__const_100^0 + n^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002371s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029975s [5440 : 5477] [5440 : 5478] Successful child: 5477 [ 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000981s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003980s [5440 : 5482] [5440 : 5483] Successful child: 5482 [ 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> New Graphs: LOG: CALL check - Post:1 <= __const_10^0 + __const_11^0 - Process 3 * Exit transition: * Postcondition : 1 <= __const_10^0 + __const_11^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000964s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001071s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= __const_10^0 + __const_11^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_11^0 <= 0 , [5440 : 5487] [5440 : 5488] [5440 : 5489] [5440 : 5490] [5440 : 5491] [5440 : 5492] [5440 : 5493] INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_100^0 + __const_10^0 + __const_11^0 + e^0 <= 1 + n^0 , __const_10^0 <= 1 , Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_11^0, e^0, n^0, __const_10^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007490s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.515786s [5440 : 5494] [5440 : 5495] Successful child: 5494 [ 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006042s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.315746s [5440 : 5499] [5440 : 5500] Successful child: 5500 Ranking function: -__const_100^0 + __const_10^0 + n^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002665s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024210s [5440 : 5504] [5440 : 5505] Successful child: 5504 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001154s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004539s [5440 : 5509] [5440 : 5510] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033732s Time used: 0.032711 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001063s Time used: 1.00103 LOG: SAT solveNonLinear - Elapsed time: 1.034795s Cost: 1; Total time: 1.03374 Quasi-ranking function: 50000 + __const_10^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001256s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007972s [5440 : 5643] [5440 : 5644] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038011s Time used: 0.036697 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001074s Time used: 1.00104 LOG: SAT solveNonLinear - Elapsed time: 1.039085s Cost: 1; Total time: 1.03774 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 - __const_100^0 + __const_10^0 + __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001384s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005998s [5440 : 5681] [5440 : 5682] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036142s Time used: 0.034727 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.017711s Time used: 1.01768 LOG: SAT solveNonLinear - Elapsed time: 1.053852s Cost: 1; Total time: 1.05241 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 - __const_100^0 + __const_10^0 - __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001528s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008013s [5440 : 5686] [5440 : 5687] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044432s Time used: 0.042775 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001144s Time used: 1.00112 LOG: SAT solveNonLinear - Elapsed time: 1.045576s Cost: 1; Total time: 1.0439 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_10^0 + __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001605s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007702s [5440 : 5941] [5440 : 5942] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035986s Time used: 0.033847 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001373s Time used: 1.00134 LOG: SAT solveNonLinear - Elapsed time: 1.037359s Cost: 1; Total time: 1.03519 Quasi-ranking function: 50000 - __const_100^0 + __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001727s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008537s [5440 : 5948] [5440 : 5949] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038727s Time used: 0.036114 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001249s Time used: 1.00123 LOG: SAT solveNonLinear - Elapsed time: 1.039977s Cost: 1; Total time: 1.03734 Termination implied by a set of invariant(s): Invariant at l1: 0 <= 1 + e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 - __const_100^0 - __const_10^0 + __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001854s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011476s [5440 : 5953] [5440 : 5954] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047473s Time used: 0.044718 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001424s Time used: 1.00124 LOG: SAT solveNonLinear - Elapsed time: 1.048897s Cost: 1; Total time: 1.04596 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 - __const_100^0 - __const_10^0 - __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001873s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011752s [5440 : 5960] [5440 : 5961] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037943s Time used: 0.035086 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002482s Time used: 1.00246 LOG: SAT solveNonLinear - Elapsed time: 1.040425s Cost: 1; Total time: 1.03755 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_100^0 - __const_10^0 + __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002053s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013719s [5440 : 5965] [5440 : 5966] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044722s Time used: 0.041765 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001036s Time used: 1.001 LOG: SAT solveNonLinear - Elapsed time: 1.045758s Cost: 1; Total time: 1.04277 Quasi-ranking function: 50000 - __const_100^0 + __const_10^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002155s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014811s [5440 : 5970] [5440 : 5971] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042275s Time used: 0.039069 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001784s Time used: 1.00177 LOG: SAT solveNonLinear - Elapsed time: 1.044059s Cost: 1; Total time: 1.04083 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_100^0 + __const_10^0 + __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002288s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022035s [5440 : 5975] [5440 : 5976] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040015s Time used: 0.036658 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001091s Time used: 1.00106 LOG: SAT solveNonLinear - Elapsed time: 1.041105s Cost: 1; Total time: 1.03772 Quasi-ranking function: 50000 + __const_100^0 + __const_10^0 + __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002406s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034192s [5440 : 5989] [5440 : 5990] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039817s Time used: 0.036349 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001856s Time used: 1.00182 LOG: SAT solveNonLinear - Elapsed time: 1.041673s Cost: 1; Total time: 1.03817 Quasi-ranking function: 50000 + __const_100^0 + __const_10^0 - __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002509s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023261s [5440 : 5994] [5440 : 5995] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040389s Time used: 0.03678 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001538s Time used: 1.00152 LOG: SAT solveNonLinear - Elapsed time: 1.041927s Cost: 1; Total time: 1.0383 Quasi-ranking function: 50000 + __const_100^0 + __const_10^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002630s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014333s [5440 : 6095] [5440 : 6096] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042381s Time used: 0.038605 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002824s Time used: 1.0028 LOG: SAT solveNonLinear - Elapsed time: 1.045205s Cost: 1; Total time: 1.0414 Termination implied by a set of invariant(s): Invariant at l1: 0 <= 1 + e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_10^0 - __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002799s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015165s [5440 : 6100] [5440 : 6101] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042936s Time used: 0.038941 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001724s Time used: 1.00152 LOG: SAT solveNonLinear - Elapsed time: 1.044660s Cost: 1; Total time: 1.04046 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 - __const_100^0 + __const_10^0 - __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002887s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024392s [5440 : 6105] [5440 : 6106] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043657s Time used: 0.039619 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.023013s Time used: 1.023 LOG: SAT solveNonLinear - Elapsed time: 1.066670s Cost: 1; Total time: 1.06262 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 - __const_100^0 + __const_10^0 + __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003071s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022027s [5440 : 6110] [5440 : 6111] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053172s Time used: 0.049054 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001532s Time used: 1.00152 LOG: SAT solveNonLinear - Elapsed time: 1.054704s Cost: 1; Total time: 1.05057 Termination implied by a set of invariant(s): Invariant at l1: 0 <= 1 + e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_100^0 - __const_10^0 - __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003179s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019556s [5440 : 6115] [5440 : 6116] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045543s Time used: 0.041548 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001676s Time used: 1.00165 LOG: SAT solveNonLinear - Elapsed time: 1.047219s Cost: 1; Total time: 1.0432 Quasi-ranking function: 50000 - __const_100^0 - __const_10^0 - __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003318s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018863s [5440 : 6120] [5440 : 6121] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044525s Time used: 0.040449 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001583s Time used: 1.00155 LOG: SAT solveNonLinear - Elapsed time: 1.046107s Cost: 1; Total time: 1.042 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 - __const_10^0 + __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003399s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016337s [5440 : 6125] [5440 : 6126] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045597s Time used: 0.041297 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002870s Time used: 1.00285 LOG: SAT solveNonLinear - Elapsed time: 1.048467s Cost: 1; Total time: 1.04415 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_11^0 - e^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003550s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024249s [5440 : 6130] [5440 : 6131] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046620s Time used: 0.042298 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001595s Time used: 1.00157 LOG: SAT solveNonLinear - Elapsed time: 1.048215s Cost: 1; Total time: 1.04386 Termination implied by a set of invariant(s): Invariant at l1: 0 <= 1 + e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_100^0 + __const_10^0 - __const_11^0 - 3*e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003702s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.074283s [5440 : 6135] [5440 : 6136] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045554s Time used: 0.041215 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001538s Time used: 1.0015 LOG: SAT solveNonLinear - Elapsed time: 1.047092s Cost: 1; Total time: 1.04272 Quasi-ranking function: 50000 + __const_10^0 + __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003823s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024786s [5440 : 6140] [5440 : 6141] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049436s Time used: 0.045001 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001661s Time used: 1.00164 LOG: SAT solveNonLinear - Elapsed time: 1.051097s Cost: 1; Total time: 1.04664 Quasi-ranking function: 50000 + __const_100^0 + __const_10^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003956s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034535s [5440 : 6145] [5440 : 6146] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048198s Time used: 0.043572 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.032933s Time used: 1.03291 LOG: SAT solveNonLinear - Elapsed time: 1.081130s Cost: 1; Total time: 1.07648 Quasi-ranking function: 50000 - __const_100^0 + __const_10^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004084s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028442s [5440 : 6246] [5440 : 6247] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052643s Time used: 0.04808 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001732s Time used: 1.00171 LOG: SAT solveNonLinear - Elapsed time: 1.054374s Cost: 1; Total time: 1.04979 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_10^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004194s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027050s [5440 : 6251] [5440 : 6252] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049817s Time used: 0.044943 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001901s Time used: 1.00171 LOG: SAT solveNonLinear - Elapsed time: 1.051717s Cost: 1; Total time: 1.04666 Termination implied by a set of invariant(s): Invariant at l1: 0 <= e^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + e^0, n^0 -> -__const_10^0 + n^0, 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): 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Quasi-ranking function: 50000 + __const_10^0 - __const_11^0 - e^0 + n^0 New Graphs: Transitions: 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}> Variables: __const_100^0, __const_10^0, __const_11^0, e^0, n^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004337s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.031111s [5440 : 6256] [5440 : 6257] Timeout expired! [5440 : 6261] [5440 : 6265] Successful child: 6261 Program does NOT terminate