Time Complexity of LLVM IR Code

Hello,
I want to find complexity of code in IR…Like if we have 2 nested loops

for(i=0;i<N1;i++)
for(j=0;j<N1;j++)
{

}

Here N1 is unknown at compile time.

So complexity will be N1^2…How can I find this by doing LLVM IR analysis?

Maybe this project can help you:
https://github.com/demontiejr/asymptus

Regards,
Victor.