YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0}> (0 + tmp___4^0), ni^0 -> (1 + ni^0)}> 1}> 0}> undef230, nj^0 -> (1 + nj^0)}> 0}> 0, nj^0 -> 0}> 0}> (0 + tmp___3^0), ni^0 -> 0}> 1}> 0}> undef515, ni^0 -> (1 + ni^0)}> 0}> (0 + tmp___2^0), ni^0 -> 0}> 1}> 0}> undef756, ni^0 -> (1 + ni^0)}> (0 + tmp___1^0), nj^0 -> (1 + nj^0)}> 1}> 0}> 0}> (1 + ni^0)}> 0}> (1 + ni^0)}> (0 + tmp___0^0), ni^0 -> (1 + ni^0)}> 0}> 1}> 0}> 0}> 0}> 0}> (1 + ni^0)}> 0}> 1}> 1}> 1}> 1}> (0 + tmp___6^0)}> 1}> 0}> 0}> 0}> 0}> 0}> (0 + tmp___5^0), nj^0 -> (1 + nj^0)}> 1}> 0}> undef2141, ni^0 -> (1 + ni^0)}> 0, ni^0 -> 0}> 1, bDomain^0 -> 1, bSum^0 -> 1, bSymmetry^0 -> 0, nDim^0 -> 4, nN^0 -> undef2228, nSumCol^0 -> 0, nSumDiag1^0 -> 0, nSumDiag2^0 -> 0, nSumRow^0 -> 0, nSum^0 -> undef2233, ni^0 -> 0, tmp^0 -> undef2236}> Fresh variables: undef230, undef515, undef756, undef2141, undef2228, undef2233, undef2236, Undef variables: undef230, undef515, undef756, undef2141, undef2228, undef2233, undef2236, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 1), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 1), nSumRow^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 1), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 1), nSumRow^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> undef230, nj^0 -> (1 + nj^0)}> 0}> (1 + ni^0), nj^0 -> (1 + (1 + ni^0))}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 1), nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 0), nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0}> (0 + 1), nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0}> undef515, ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> 0}> (0 + 0), ni^0 -> 0}> (0 + 0), ni^0 -> 0}> (0 + 1), ni^0 -> 0}> (0 + 0), ni^0 -> 0}> (0 + 0), ni^0 -> 0}> (0 + 1), ni^0 -> 0}> undef756, ni^0 -> (1 + ni^0)}> 0}> 0, nj^0 -> (1 + 0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> 0}> (1 + ni^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> (1 + nj^0)}> undef2141, ni^0 -> (1 + ni^0)}> (0 + 1)}> (0 + 0)}> (0 + 0)}> (0 + 0)}> (0 + 0)}> Fresh variables: undef230, undef515, undef756, undef2141, undef2228, undef2233, undef2236, Undef variables: undef230, undef515, undef756, undef2141, undef2228, undef2233, undef2236, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + ni^0, rest remain the same}> Variables: nN^0, ni^0 Graph 2: Transitions: 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> Variables: bDomain^0, nN^0, ni^0 Graph 3: Transitions: 1 + ni^0, nj^0 -> 2 + ni^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: nN^0, ni^0, nj^0, bDistinct^0 Graph 4: Transitions: undef756, ni^0 -> 1 + ni^0, rest remain the same}> Variables: nSumDiag1^0, ni^0 Graph 5: Transitions: undef515, ni^0 -> 1 + ni^0, rest remain the same}> Variables: nSumDiag2^0, ni^0 Graph 6: Transitions: 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 1, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 1, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> undef230, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bSum^0, ni^0, nj^0, nSumRow^0, nSum^0 Graph 7: Transitions: 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> undef2141, ni^0 -> 1 + ni^0, rest remain the same}> Variables: bSum^0, ni^0, nj^0, nSumCol^0, nSum^0 Graph 8: Transitions: Variables: Graph 9: Transitions: Variables: Graph 10: Transitions: Variables: Graph 11: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 0, rest remain the same}> Graph 3 0, nj^0 -> 1, rest remain the same}> Graph 4 0, rest remain the same}> 0, rest remain the same}> Graph 5 0, ni^0 -> 0, rest remain the same}> 0, ni^0 -> 0, rest remain the same}> 0, ni^0 -> 0, rest remain the same}> 1, ni^0 -> 0, rest remain the same}> 0, ni^0 -> 0, rest remain the same}> 0, ni^0 -> 0, rest remain the same}> 1, ni^0 -> 0, rest remain the same}> Graph 6 0, nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 1, nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 1, nSumRow^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> Graph 7 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 1, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 1, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> Graph 8 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Graph 9 1, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> Graph 10 Graph 11 Map Locations to Subgraph: ( 0 , 0 ) ( 9 , 6 ) ( 14 , 3 ) ( 19 , 5 ) ( 20 , 4 ) ( 31 , 2 ) ( 38 , 1 ) ( 39 , 7 ) ( 42 , 11 ) ( 44 , 10 ) ( 47 , 9 ) ( 52 , 8 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001161 Checking conditional termination of SCC {l38}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000966s Ranking function: -1 + nN^0 - ni^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.008587 Checking conditional termination of SCC {l31}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002686s Ranking function: -2 + 2*nN^0 - 2*ni^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.106669 Checking conditional termination of SCC {l14}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004762s Ranking function: -2 + nN^0 - ni^0 New Graphs: Transitions: 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bDistinct^0, nN^0, nj^0 Checking conditional termination of SCC {l14}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001917s Ranking function: -2 + 2*nN^0 - 2*nj^0 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.000962 Checking conditional termination of SCC {l20}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000733s Ranking function: 3 - ni^0 New Graphs: Proving termination of subgraph 5 Checking unfeasibility... Time used: 0.001484 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000755s Ranking function: 3 - ni^0 New Graphs: Proving termination of subgraph 6 Checking unfeasibility... Time used: 0.016199 Some transition disabled by a set of invariant(s): Invariant at l9: 0 <= bSum^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef230, nj^0 -> 1 + nj^0, rest remain the same}> Checking unfeasibility... Time used: 0.034794 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003518s Ranking function: -4 + 6*bSum^0 - ni^0 New Graphs: Transitions: 0, nSumRow^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> undef230, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bSum^0, nSumRow^0, ni^0, nj^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001124s Ranking function: 2 - ni^0 New Graphs: Transitions: undef230, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bSum^0, nSumRow^0, nj^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000795s Ranking function: 3 - nj^0 New Graphs: Proving termination of subgraph 7 Checking unfeasibility... Time used: 0.017063 Some transition disabled by a set of invariant(s): Invariant at l39: 0 <= bSum^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef2141, ni^0 -> 1 + ni^0, rest remain the same}> Checking unfeasibility... Time used: 0.042673 Checking conditional termination of SCC {l39}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003639s Ranking function: -4 + 6*bSum^0 - nj^0 New Graphs: Transitions: 0, nSumCol^0 -> 0, ni^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}> undef2141, ni^0 -> 1 + ni^0, rest remain the same}> Variables: bSum^0, nSumCol^0, ni^0, nj^0 Checking conditional termination of SCC {l39}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001186s Ranking function: 2 - nj^0 New Graphs: Transitions: undef2141, ni^0 -> 1 + ni^0, rest remain the same}> Variables: bSum^0, nSumCol^0, ni^0 Checking conditional termination of SCC {l39}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000856s Ranking function: 3 - ni^0 New Graphs: Proving termination of subgraph 8 Analyzing SCC {l52}... No cycles found. Proving termination of subgraph 9 Analyzing SCC {l47}... No cycles found. Proving termination of subgraph 10 Analyzing SCC {l44}... No cycles found. Proving termination of subgraph 11 Analyzing SCC {l42}... No cycles found. Program Terminates