2020-06-21 22:26:27
Full thread dump Java HotSpot(TM) 64-Bit Server VM (25.144-b01 mixed mode):

"ThreadPoolThread93" #122 daemon prio=6 os_prio=0 tid=0x00002ac75c042000 nid=0x5682 runnable [0x00002ac72ed2e000]
   java.lang.Thread.State: RUNNABLE
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doOneNarrowingStep(NonTerminationProcessor.java:461)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doClosure(NonTerminationProcessor.java:341)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doHeuristic(NonTerminationProcessor.java:284)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.processQDPProblem(NonTerminationProcessor.java:262)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor.processQDPProblem(NonTerminationProcessor.java:107)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread90" #119 daemon prio=6 os_prio=0 tid=0x00002ac75c040000 nid=0x5675 runnable [0x00002ac72f91c000]
   java.lang.Thread.State: RUNNABLE
	at aprove.DPFramework.BasicStructures.Unification.TermPairDagNode.addFather(TermPairDagNode.java:66)
	at aprove.DPFramework.BasicStructures.Unification.TermPairDag.addDirectedEdge(TermPairDag.java:164)
	at aprove.DPFramework.BasicStructures.Unification.TermPairDag.addNodeToDag(TermPairDag.java:140)
	at aprove.DPFramework.BasicStructures.Unification.TermPairDag.addTermWithFullSharing(TermPairDag.java:88)
	at aprove.DPFramework.BasicStructures.Unification.TermPairDag.addTermWithFullSharing(TermPairDag.java:95)
	at aprove.DPFramework.BasicStructures.Unification.TermPairDag.addTermWithFullSharing(TermPairDag.java:95)
	at aprove.DPFramework.BasicStructures.Unification.TermPairDag.addTermWithFullSharing(TermPairDag.java:95)
	at aprove.DPFramework.BasicStructures.Unification.TermPairDag.<init>(TermPairDag.java:56)
	at aprove.DPFramework.BasicStructures.Unification.UnificationDag.<init>(UnificationDag.java:22)
	at aprove.DPFramework.BasicStructures.Unification.Unification.<init>(Unification.java:72)
	at aprove.DPFramework.BasicStructures.TRSTerm.getMGU(TRSTerm.java:397)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doOneNarrowingStep(NonTerminationProcessor.java:531)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doClosure(NonTerminationProcessor.java:341)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doHeuristic(NonTerminationProcessor.java:284)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.processQDPProblem(NonTerminationProcessor.java:262)
	at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor.processQDPProblem(NonTerminationProcessor.java:107)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread86" #115 daemon prio=6 os_prio=0 tid=0x00002ac75c03a800 nid=0x5671 runnable [0x00002ac72f26b000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.forkAndExec(Native Method)
	at java.lang.UNIXProcess.<init>(UNIXProcess.java:247)
	at java.lang.ProcessImpl.start(ProcessImpl.java:134)
	at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
	at java.lang.Runtime.exec(Runtime.java:620)
	at java.lang.Runtime.exec(Runtime.java:450)
	at java.lang.Runtime.exec(Runtime.java:347)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.<init>(MiniSATFileChecker.java:114)
	at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:264)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229)
	at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201)
	at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread84" #113 daemon prio=6 os_prio=0 tid=0x00002ac75c029800 nid=0x566f runnable [0x00002ac6f32c7000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.forkAndExec(Native Method)
	at java.lang.UNIXProcess.<init>(UNIXProcess.java:247)
	at java.lang.ProcessImpl.start(ProcessImpl.java:134)
	at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
	at java.lang.Runtime.exec(Runtime.java:620)
	at java.lang.Runtime.exec(Runtime.java:450)
	at java.lang.Runtime.exec(Runtime.java:347)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.<init>(MiniSATFileChecker.java:112)
	at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54)
	at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:330)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread81" #110 daemon prio=6 os_prio=0 tid=0x00002ac75c036800 nid=0x5669 runnable [0x00002ac72eb2b000]
   java.lang.Thread.State: RUNNABLE
	at java.io.FileInputStream.readBytes(Native Method)
	at java.io.FileInputStream.read(FileInputStream.java:255)
	at java.io.BufferedInputStream.read1(BufferedInputStream.java:284)
	at java.io.BufferedInputStream.read(BufferedInputStream.java:345)
	- locked <0x00000006faab23a0> (a java.lang.UNIXProcess$ProcessPipeInputStream)
	at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
	at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
	at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
	- locked <0x00000006faab6a48> (a java.io.InputStreamReader)
	at java.io.InputStreamReader.read(InputStreamReader.java:184)
	at java.io.BufferedReader.fill(BufferedReader.java:161)
	at java.io.BufferedReader.readLine(BufferedReader.java:324)
	- locked <0x00000006faab6a48> (a java.io.InputStreamReader)
	at java.io.BufferedReader.readLine(BufferedReader.java:389)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161)
	at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.solveWithoutOptimizing(POLOSolver.java:230)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:209)
	at aprove.DPFramework.TRSProblem.Solvers.RRRPoloSolver.solveRRR(RRRPoloSolver.java:53)
	at aprove.DPFramework.TRSProblem.Solvers.RRRPoloSolver.solveRRR(RRRPoloSolver.java:20)
	at aprove.DPFramework.DPProblem.Processors.MRRProcessor.processQDPProblem(MRRProcessor.java:61)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread80" #109 daemon prio=6 os_prio=0 tid=0x00002ac75c019000 nid=0x5668 runnable [0x00002ac6f3dd0000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.forkAndExec(Native Method)
	at java.lang.UNIXProcess.<init>(UNIXProcess.java:247)
	at java.lang.ProcessImpl.start(ProcessImpl.java:134)
	at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
	at java.lang.Runtime.exec(Runtime.java:620)
	at java.lang.Runtime.exec(Runtime.java:450)
	at java.lang.Runtime.exec(Runtime.java:347)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.<init>(MiniSATFileChecker.java:114)
	at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:264)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229)
	at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201)
	at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread79" #108 daemon prio=6 os_prio=0 tid=0x00002ac75c01d000 nid=0x5667 runnable [0x00002ac72f069000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.forkAndExec(Native Method)
	at java.lang.UNIXProcess.<init>(UNIXProcess.java:247)
	at java.lang.ProcessImpl.start(ProcessImpl.java:134)
	at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
	at java.lang.Runtime.exec(Runtime.java:620)
	at java.lang.Runtime.exec(Runtime.java:450)
	at java.lang.Runtime.exec(Runtime.java:347)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.<init>(MiniSATFileChecker.java:114)
	at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:158)
	at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191)
	at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread78" #107 daemon prio=6 os_prio=0 tid=0x00002ac75c00b800 nid=0x5666 runnable [0x00002ac72f6e1000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.forkAndExec(Native Method)
	at java.lang.UNIXProcess.<init>(UNIXProcess.java:247)
	at java.lang.ProcessImpl.start(ProcessImpl.java:134)
	at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
	at java.lang.Runtime.exec(Runtime.java:620)
	at java.lang.Runtime.exec(Runtime.java:450)
	at java.lang.Runtime.exec(Runtime.java:347)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.<init>(MiniSATFileChecker.java:114)
	at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54)
	at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:330)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread77" #106 daemon prio=6 os_prio=0 tid=0x00002ac75c023800 nid=0x5663 runnable [0x00002ac72f7e2000]
   java.lang.Thread.State: RUNNABLE
	at java.io.FileInputStream.readBytes(Native Method)
	at java.io.FileInputStream.read(FileInputStream.java:255)
	at java.io.BufferedInputStream.read1(BufferedInputStream.java:284)
	at java.io.BufferedInputStream.read(BufferedInputStream.java:345)
	- locked <0x00000006fa3fef28> (a java.lang.UNIXProcess$ProcessPipeInputStream)
	at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
	at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
	at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
	- locked <0x00000006fa4035d0> (a java.io.InputStreamReader)
	at java.io.InputStreamReader.read(InputStreamReader.java:184)
	at java.io.BufferedReader.fill(BufferedReader.java:161)
	at java.io.BufferedReader.readLine(BufferedReader.java:324)
	- locked <0x00000006fa4035d0> (a java.io.InputStreamReader)
	at java.io.BufferedReader.readLine(BufferedReader.java:389)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161)
	at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.solveWithoutOptimizing(POLOSolver.java:230)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:209)
	at aprove.DPFramework.TRSProblem.Solvers.RRRPoloSolver.solveRRR(RRRPoloSolver.java:53)
	at aprove.DPFramework.TRSProblem.Solvers.RRRPoloSolver.solveRRR(RRRPoloSolver.java:20)
	at aprove.DPFramework.DPProblem.Processors.MRRProcessor.processQDPProblem(MRRProcessor.java:61)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread75" #104 daemon prio=6 os_prio=0 tid=0x00002ac75c02c800 nid=0x5658 runnable [0x00002ac6f1fb5000]
   java.lang.Thread.State: RUNNABLE
	at java.util.Stack.pop(Stack.java:85)
	- locked <0x00000007059f1b18> (a java.util.Stack)
	at aprove.DPFramework.BasicStructures.Unification.Unification.finish(Unification.java:193)
	at aprove.DPFramework.BasicStructures.Unification.Unification.unify(Unification.java:147)
	at aprove.DPFramework.BasicStructures.Unification.Unification.getMgu(Unification.java:120)
	at aprove.DPFramework.BasicStructures.TRSTerm.getMGU(TRSTerm.java:397)
	at aprove.DPFramework.DPProblem.QDependencyGraph.calculateConnection(QDependencyGraph.java:447)
	at aprove.DPFramework.DPProblem.QDependencyGraph.checkEdgesOnSccs(QDependencyGraph.java:564)
	at aprove.DPFramework.DPProblem.QDependencyGraph.<init>(QDependencyGraph.java:115)
	at aprove.DPFramework.DPProblem.QDependencyGraph.create(QDependencyGraph.java:404)
	at aprove.DPFramework.DPProblem.QDPProblem.create(QDPProblem.java:163)
	at aprove.DPFramework.TRSProblem.Processors.DependencyPairsProcessor.processQTRS(DependencyPairsProcessor.java:36)
	at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread74" #103 daemon prio=6 os_prio=0 tid=0x00002ac75c010800 nid=0x5656 runnable [0x00002ac6f34ca000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.System.identityHashCode(Native Method)
	at aprove.Framework.Utility.Graph.Node.hashCode(Node.java:110)
	at java.util.HashMap.hash(HashMap.java:338)
	at java.util.LinkedHashMap.get(LinkedHashMap.java:440)
	at aprove.Framework.Utility.Graph.SimpleGraph.removeEdge(SimpleGraph.java:1639)
	at aprove.DPFramework.DPProblem.QDependencyGraph.checkEdgesOnSccs(QDependencyGraph.java:547)
	at aprove.DPFramework.DPProblem.QDependencyGraph.<init>(QDependencyGraph.java:115)
	at aprove.DPFramework.DPProblem.QDependencyGraph.create(QDependencyGraph.java:404)
	at aprove.DPFramework.DPProblem.QDPProblem.create(QDPProblem.java:163)
	at aprove.DPFramework.TRSProblem.Processors.DependencyPairsProcessor.processQTRS(DependencyPairsProcessor.java:36)
	at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread73" #102 daemon prio=6 os_prio=0 tid=0x00002ac75c00c800 nid=0x5655 runnable [0x00002ac72ea2a000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.forkAndExec(Native Method)
	at java.lang.UNIXProcess.<init>(UNIXProcess.java:247)
	at java.lang.ProcessImpl.start(ProcessImpl.java:134)
	at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
	at java.lang.Runtime.exec(Runtime.java:620)
	at java.lang.Runtime.exec(Runtime.java:485)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:268)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153)
	at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:333)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread69" #98 daemon prio=6 os_prio=0 tid=0x00002ac75c025800 nid=0x5651 runnable [0x00002ac72e828000]
   java.lang.Thread.State: RUNNABLE
	at java.io.FileInputStream.readBytes(Native Method)
	at java.io.FileInputStream.read(FileInputStream.java:255)
	at java.io.BufferedInputStream.read1(BufferedInputStream.java:284)
	at java.io.BufferedInputStream.read(BufferedInputStream.java:345)
	- locked <0x00000006ef8d7338> (a java.lang.UNIXProcess$ProcessPipeInputStream)
	at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
	at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
	at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
	- locked <0x00000006ef8db9e0> (a java.io.InputStreamReader)
	at java.io.InputStreamReader.read(InputStreamReader.java:184)
	at java.io.BufferedReader.fill(BufferedReader.java:161)
	at java.io.BufferedReader.readLine(BufferedReader.java:324)
	- locked <0x00000006ef8db9e0> (a java.io.InputStreamReader)
	at java.io.BufferedReader.readLine(BufferedReader.java:389)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:268)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229)
	at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201)
	at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"process reaper" #89 daemon prio=10 os_prio=0 tid=0x00002ac784002000 nid=0x564c waiting for monitor entry [0x00002ac72f81c000]
   java.lang.Thread.State: BLOCKED (on object monitor)
	at java.lang.UNIXProcess$ProcessPipeInputStream.processExited(UNIXProcess.java:527)
	- waiting to lock <0x00000006ef8d7338> (a java.lang.UNIXProcess$ProcessPipeInputStream)
	at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:298)
	at java.lang.UNIXProcess$$Lambda$12/1450994416.run(Unknown Source)
	at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149)
	at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624)
	at java.lang.Thread.run(Thread.java:748)

"process reaper" #88 daemon prio=10 os_prio=0 tid=0x00002ac7b8001000 nid=0x5644 runnable [0x00002ac72f3df000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.waitForProcessExit(Native Method)
	at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:289)
	at java.lang.UNIXProcess$$Lambda$12/1450994416.run(Unknown Source)
	at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149)
	at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624)
	at java.lang.Thread.run(Thread.java:748)

"process reaper" #87 daemon prio=10 os_prio=0 tid=0x00002ac780014800 nid=0x5643 waiting on condition [0x00002ac72f3a6000]
   java.lang.Thread.State: TIMED_WAITING (parking)
	at sun.misc.Unsafe.park(Native Method)
	- parking to wait for  <0x00000004401e0ac8> (a java.util.concurrent.SynchronousQueue$TransferStack)
	at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215)
	at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460)
	at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362)
	at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941)
	at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073)
	at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134)
	at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624)
	at java.lang.Thread.run(Thread.java:748)

"process reaper" #82 daemon prio=10 os_prio=0 tid=0x00002ac788008800 nid=0x5633 runnable [0x00002ac72ef69000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.waitForProcessExit(Native Method)
	at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:289)
	at java.lang.UNIXProcess$$Lambda$12/1450994416.run(Unknown Source)
	at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149)
	at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread45" #66 daemon prio=6 os_prio=0 tid=0x00002ac75c020000 nid=0x5613 runnable [0x00002ac6f25bb000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.forkAndExec(Native Method)
	at java.lang.UNIXProcess.<init>(UNIXProcess.java:247)
	at java.lang.ProcessImpl.start(ProcessImpl.java:134)
	at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
	at java.lang.Runtime.exec(Runtime.java:620)
	at java.lang.Runtime.exec(Runtime.java:450)
	at java.lang.Runtime.exec(Runtime.java:347)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.<init>(MiniSATFileChecker.java:114)
	at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:158)
	at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191)
	at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread33" #54 daemon prio=6 os_prio=0 tid=0x00002ac75c00e000 nid=0x5605 runnable [0x00002ac6f38cb000]
   java.lang.Thread.State: RUNNABLE
	at java.io.FileInputStream.readBytes(Native Method)
	at java.io.FileInputStream.read(FileInputStream.java:255)
	at java.io.BufferedInputStream.read1(BufferedInputStream.java:284)
	at java.io.BufferedInputStream.read(BufferedInputStream.java:345)
	- locked <0x00000006aee145b0> (a java.lang.UNIXProcess$ProcessPipeInputStream)
	at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
	at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
	at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
	- locked <0x00000006aee18c58> (a java.io.InputStreamReader)
	at java.io.InputStreamReader.read(InputStreamReader.java:184)
	at java.io.BufferedReader.fill(BufferedReader.java:161)
	at java.io.BufferedReader.readLine(BufferedReader.java:324)
	- locked <0x00000006aee18c58> (a java.io.InputStreamReader)
	at java.io.BufferedReader.readLine(BufferedReader.java:389)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:304)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206)
	at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153)
	at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161)
	at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294)
	at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191)
	at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94)
	at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200)
	at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"process reaper" #31 daemon prio=10 os_prio=0 tid=0x00002ac75800e800 nid=0x55ea runnable [0x00002ac6d3ffe000]
   java.lang.Thread.State: RUNNABLE
	at java.lang.UNIXProcess.waitForProcessExit(Native Method)
	at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:289)
	at java.lang.UNIXProcess$$Lambda$12/1450994416.run(Unknown Source)
	at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149)
	at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread17" #29 daemon prio=6 os_prio=0 tid=0x00002ac75c012000 nid=0x55e7 runnable [0x00002ac6f33c8000]
   java.lang.Thread.State: RUNNABLE
	at java.util.HashMap.putVal(HashMap.java:630)
	at java.util.HashMap.put(HashMap.java:611)
	at java.util.HashSet.add(HashSet.java:219)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:350)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.createStateSubstitutions(TRSBoundsTA.java:256)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.collectAllCompatibleConflicts(TRSBounds.java:1666)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.createCompatibleTA(TRSBounds.java:693)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.getCertificate(TRSBounds.java:517)
	at aprove.DPFramework.TRSProblem.Processors.QTRSRoofMatchBoundsTAProcessor.processQTRS(QTRSRoofMatchBoundsTAProcessor.java:90)
	at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread14" #26 daemon prio=6 os_prio=0 tid=0x00002ac75c015800 nid=0x55e4 runnable [0x00002ac6f35cb000]
   java.lang.Thread.State: RUNNABLE
	at aprove.DPFramework.BasicStructures.Matchbounds.EnrichmentBuilder.createER(EnrichmentBuilder.java:156)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSEnrichmentBuilder.updateEnrichedTRS(TRSEnrichmentBuilder.java:43)
	at aprove.DPFramework.BasicStructures.Matchbounds.EnrichmentBuilder.addToSignature(EnrichmentBuilder.java:69)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.resolveConflictsAndExtendSignatureOfTA(TRSBounds.java:1292)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.createCompatibleTA(TRSBounds.java:709)
	at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.getCertificate(TRSBounds.java:517)
	at aprove.DPFramework.TRSProblem.Processors.QTRSRoofMatchBoundsTAProcessor.processQTRS(QTRSRoofMatchBoundsTAProcessor.java:90)
	at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"TimeRefresherThread" #19 daemon prio=6 os_prio=0 tid=0x00002ac75c00b000 nid=0x55dd sleeping[0x00002ac6f26bd000]
   java.lang.Thread.State: TIMED_WAITING (sleeping)
	at java.lang.Thread.sleep(Native Method)
	at aprove.Strategies.Abortions.TimeRefresher$TimeRefresherThread.run(TimeRefresher.java:55)

"DefaultMachine" #18 daemon prio=6 os_prio=0 tid=0x00002ac6d49bb800 nid=0x55dc waiting on condition [0x00002ac6f24bb000]
   java.lang.Thread.State: WAITING (parking)
	at sun.misc.Unsafe.park(Native Method)
	- parking to wait for  <0x00000004400302a8> (a java.util.concurrent.locks.AbstractQueuedSynchronizer$ConditionObject)
	at java.util.concurrent.locks.LockSupport.park(LockSupport.java:175)
	at java.util.concurrent.locks.AbstractQueuedSynchronizer$ConditionObject.await(AbstractQueuedSynchronizer.java:2039)
	at java.util.concurrent.LinkedBlockingQueue.take(LinkedBlockingQueue.java:442)
	at aprove.Strategies.ExecutableStrategies.impl.DefaultMachine.run(DefaultMachine.java:169)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread2" #12 daemon prio=5 os_prio=0 tid=0x00002ac6d425c800 nid=0x55d6 runnable [0x00002ac6f21b7000]
   java.lang.Thread.State: RUNNABLE
	at java.util.ArrayList.toArray(ArrayList.java:376)
	at java.util.ArrayList.<init>(ArrayList.java:177)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.StringPattern.<init>(StringPattern.java:38)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.DerivationPattern.minimize(DerivationPattern.java:158)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.DerivationPattern.minimize(DerivationPattern.java:192)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.DerivationPattern.overlapsWith(DerivationPattern.java:582)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.DerivationPattern.overlapsWith(DerivationPattern.java:250)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.findNonLoop(NonLoopFinder.java:138)
	at aprove.DPFramework.TRSProblem.Processors.SRSNonLoopProcessor.processQTRS(SRSNonLoopProcessor.java:69)
	at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"ThreadPoolThread1" #11 daemon prio=5 os_prio=0 tid=0x00002ac6d424e800 nid=0x55d5 runnable [0x00002ac6f20b6000]
   java.lang.Thread.State: RUNNABLE
	at immutables.Immutable.ImmutableIterator.next(Unknown Source)
	at immutables.Immutable.ImmutableListIterator.next(Unknown Source)
	at java.util.AbstractList.equals(AbstractList.java:522)
	at immutables.Immutable.ImmutableArrayList.equals(Unknown Source)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.StringPattern.equals(StringPattern.java:68)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.WordPattern.equals(WordPattern.java:136)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.DerivationPattern.equals(DerivationPattern.java:750)
	at java.util.HashMap.getNode(HashMap.java:571)
	at java.util.HashMap.containsKey(HashMap.java:595)
	at java.util.HashSet.contains(HashSet.java:203)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.testAndInsert(NonLoopFinder.java:181)
	at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.findNonLoop(NonLoopFinder.java:143)
	at aprove.DPFramework.TRSProblem.Processors.SRSNonLoopProcessor.processQTRS(SRSNonLoopProcessor.java:69)
	at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34)
	at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326)
	at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377)
	at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99)
	at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274)
	at java.lang.Thread.run(Thread.java:748)

"Service Thread" #8 daemon prio=9 os_prio=0 tid=0x00002ac6d4199800 nid=0x55d2 runnable [0x0000000000000000]
   java.lang.Thread.State: RUNNABLE

"C1 CompilerThread2" #7 daemon prio=9 os_prio=0 tid=0x00002ac6d4184000 nid=0x55d1 runnable [0x0000000000000000]
   java.lang.Thread.State: RUNNABLE

"C2 CompilerThread1" #6 daemon prio=9 os_prio=0 tid=0x00002ac6d4182000 nid=0x55d0 runnable [0x0000000000000000]
   java.lang.Thread.State: RUNNABLE

"C2 CompilerThread0" #5 daemon prio=9 os_prio=0 tid=0x00002ac6d417f800 nid=0x55cf runnable [0x0000000000000000]
   java.lang.Thread.State: RUNNABLE

"Signal Dispatcher" #4 daemon prio=9 os_prio=0 tid=0x00002ac6d417e000 nid=0x55ce waiting on condition [0x0000000000000000]
   java.lang.Thread.State: RUNNABLE

"Finalizer" #3 daemon prio=8 os_prio=0 tid=0x00002ac6d414a000 nid=0x55cd in Object.wait() [0x00002ac6f170d000]
   java.lang.Thread.State: WAITING (on object monitor)
	at java.lang.Object.wait(Native Method)
	- waiting on <0x00000004409bcaa8> (a java.lang.ref.ReferenceQueue$Lock)
	at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:143)
	- locked <0x00000004409bcaa8> (a java.lang.ref.ReferenceQueue$Lock)
	at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:164)
	at java.lang.ref.Finalizer$FinalizerThread.run(Finalizer.java:209)

"Reference Handler" #2 daemon prio=10 os_prio=0 tid=0x00002ac6d4145800 nid=0x55cc in Object.wait() [0x00002ac6f160c000]
   java.lang.Thread.State: WAITING (on object monitor)
	at java.lang.Object.wait(Native Method)
	- waiting on <0x0000000440091388> (a java.lang.ref.Reference$Lock)
	at java.lang.Object.wait(Object.java:502)
	at java.lang.ref.Reference.tryHandlePending(Reference.java:191)
	- locked <0x0000000440091388> (a java.lang.ref.Reference$Lock)
	at java.lang.ref.Reference$ReferenceHandler.run(Reference.java:153)

"main" #1 prio=5 os_prio=0 tid=0x00002ac6d4008800 nid=0x55c5 in Object.wait() [0x00002ac6d0ea2000]
   java.lang.Thread.State: WAITING (on object monitor)
	at java.lang.Object.wait(Native Method)
	- waiting on <0x0000000440030868> (a aprove.Strategies.ExecutableStrategies.impl.Handle)
	at java.lang.Object.wait(Object.java:502)
	at aprove.Strategies.ExecutableStrategies.impl.Handle.waitForFinish(Handle.java:42)
	- locked <0x0000000440030868> (a aprove.Strategies.ExecutableStrategies.impl.Handle)
	at aprove.Runtime.AProVE.waitForHandle(AProVE.java:32)
	at aprove.Runtime.AProVE.run(AProVE.java:101)
	at aprove.CommandLineInterface.Main.run(Main.java:94)
	at aprove.CommandLineInterface.Main.doMain(Main.java:42)
	at aprove.Main.doMain(Main.java:54)
	at aprove.Main.main(Main.java:20)

"VM Thread" os_prio=0 tid=0x00002ac6d413e000 nid=0x55cb runnable 

"GC task thread#0 (ParallelGC)" os_prio=0 tid=0x00002ac6d401e000 nid=0x55c7 runnable 

"GC task thread#1 (ParallelGC)" os_prio=0 tid=0x00002ac6d401f800 nid=0x55c8 runnable 

"GC task thread#2 (ParallelGC)" os_prio=0 tid=0x00002ac6d4021800 nid=0x55c9 runnable 

"GC task thread#3 (ParallelGC)" os_prio=0 tid=0x00002ac6d4023800 nid=0x55ca runnable 

"VM Periodic Task Thread" os_prio=0 tid=0x00002ac6d41a4000 nid=0x55d3 waiting on condition 

JNI global references: 386

Heap
 PSYoungGen      total 4281856K, used 1848505K [0x0000000695580000, 0x00000007c0000000, 0x00000007c0000000)
  eden space 3670528K, 50% used [0x0000000695580000,0x00000007062ae448,0x0000000775600000)
  from space 611328K, 0% used [0x0000000775600000,0x0000000775600000,0x000000079ab00000)
  to   space 611328K, 0% used [0x000000079ab00000,0x000000079ab00000,0x00000007c0000000)
 ParOldGen       total 9786880K, used 50512K [0x0000000440000000, 0x0000000695580000, 0x0000000695580000)
  object space 9786880K, 0% used [0x0000000440000000,0x0000000443154020,0x0000000695580000)
 Metaspace       used 21205K, capacity 21462K, committed 21760K, reserved 1069056K
  class space    used 2443K, capacity 2529K, committed 2560K, reserved 1048576K

YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 27 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) AND
    (7) QDP
        (8) UsableRulesProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) MRRProof [EQUIVALENT, 33 ms]
        (11) QDP
        (12) DependencyGraphProof [EQUIVALENT, 0 ms]
        (13) AND
            (14) QDP
                (15) QDPOrderProof [EQUIVALENT, 7 ms]
                (16) QDP
                (17) DependencyGraphProof [EQUIVALENT, 0 ms]
                (18) TRUE
            (19) QDP
                (20) QDPOrderProof [EQUIVALENT, 5 ms]
                (21) QDP
                (22) PisEmptyProof [EQUIVALENT, 0 ms]
                (23) YES
    (24) QDP
        (25) UsableRulesProof [EQUIVALENT, 0 ms]
        (26) QDP
        (27) MRRProof [EQUIVALENT, 0 ms]
        (28) QDP
        (29) PisEmptyProof [EQUIVALENT, 0 ms]
        (30) YES


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   a(s(x1)) -> s(a(x1))
   b(a(b(s(x1)))) -> a(b(s(a(x1))))
   b(a(b(b(x1)))) -> c(s(x1))
   c(s(x1)) -> a(b(a(b(x1))))
   a(b(a(a(x1)))) -> b(a(b(a(x1))))

Q is empty.

----------------------------------------

(1) QTRS Reverse (EQUIVALENT)
We applied the QTRS Reverse Processor [REVERSE].
----------------------------------------

(2)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   s(a(x1)) -> a(s(x1))
   s(b(a(b(x1)))) -> a(s(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))
   s(c(x1)) -> b(a(b(a(x1))))
   a(a(b(a(x1)))) -> a(b(a(b(x1))))

Q is empty.

----------------------------------------

(3) DependencyPairsProof (EQUIVALENT)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
----------------------------------------

(4)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   S(a(x1)) -> A(s(x1))
   S(a(x1)) -> S(x1)
   S(b(a(b(x1)))) -> A(s(b(a(x1))))
   S(b(a(b(x1)))) -> S(b(a(x1)))
   S(b(a(b(x1)))) -> B(a(x1))
   S(b(a(b(x1)))) -> A(x1)
   B(b(a(b(x1)))) -> S(c(x1))
   S(c(x1)) -> B(a(b(a(x1))))
   S(c(x1)) -> A(b(a(x1)))
   S(c(x1)) -> B(a(x1))
   S(c(x1)) -> A(x1)
   A(a(b(a(x1)))) -> A(b(a(b(x1))))
   A(a(b(a(x1)))) -> B(a(b(x1)))
   A(a(b(a(x1)))) -> A(b(x1))
   A(a(b(a(x1)))) -> B(x1)

The TRS R consists of the following rules:

   s(a(x1)) -> a(s(x1))
   s(b(a(b(x1)))) -> a(s(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))
   s(c(x1)) -> b(a(b(a(x1))))
   a(a(b(a(x1)))) -> a(b(a(b(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(5) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 4 less nodes.
----------------------------------------

(6)
Complex Obligation (AND)

----------------------------------------

(7)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   S(c(x1)) -> B(a(b(a(x1))))
   B(b(a(b(x1)))) -> S(c(x1))
   S(c(x1)) -> A(b(a(x1)))
   A(a(b(a(x1)))) -> A(b(a(b(x1))))
   A(a(b(a(x1)))) -> B(a(b(x1)))
   A(a(b(a(x1)))) -> A(b(x1))
   A(a(b(a(x1)))) -> B(x1)
   S(c(x1)) -> B(a(x1))
   S(c(x1)) -> A(x1)

The TRS R consists of the following rules:

   s(a(x1)) -> a(s(x1))
   s(b(a(b(x1)))) -> a(s(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))
   s(c(x1)) -> b(a(b(a(x1))))
   a(a(b(a(x1)))) -> a(b(a(b(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(8) UsableRulesProof (EQUIVALENT)
We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.
----------------------------------------

(9)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   S(c(x1)) -> B(a(b(a(x1))))
   B(b(a(b(x1)))) -> S(c(x1))
   S(c(x1)) -> A(b(a(x1)))
   A(a(b(a(x1)))) -> A(b(a(b(x1))))
   A(a(b(a(x1)))) -> B(a(b(x1)))
   A(a(b(a(x1)))) -> A(b(x1))
   A(a(b(a(x1)))) -> B(x1)
   S(c(x1)) -> B(a(x1))
   S(c(x1)) -> A(x1)

The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(10) MRRProof (EQUIVALENT)
By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.

Strictly oriented dependency pairs:

   S(c(x1)) -> A(b(a(x1)))
   A(a(b(a(x1)))) -> A(b(x1))
   A(a(b(a(x1)))) -> B(x1)
   S(c(x1)) -> B(a(x1))
   S(c(x1)) -> A(x1)


Used ordering: Polynomial interpretation [POLO]:

   POL(A(x_1)) = x_1
   POL(B(x_1)) = 1 + x_1
   POL(S(x_1)) = 2 + x_1
   POL(a(x_1)) = 1 + x_1
   POL(b(x_1)) = 1 + x_1
   POL(c(x_1)) = 2 + x_1
   POL(s(x_1)) = 2 + x_1


----------------------------------------

(11)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   S(c(x1)) -> B(a(b(a(x1))))
   B(b(a(b(x1)))) -> S(c(x1))
   A(a(b(a(x1)))) -> A(b(a(b(x1))))
   A(a(b(a(x1)))) -> B(a(b(x1)))

The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(12) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 1 less node.
----------------------------------------

(13)
Complex Obligation (AND)

----------------------------------------

(14)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   B(b(a(b(x1)))) -> S(c(x1))
   S(c(x1)) -> B(a(b(a(x1))))

The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(15) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   B(b(a(b(x1)))) -> S(c(x1))
The remaining pairs can at least be oriented weakly.
Used ordering:  Polynomial interpretation [POLO]:

   POL(B(x_1)) = x_1
   POL(S(x_1)) = x_1
   POL(a(x_1)) = 0
   POL(b(x_1)) = 1
   POL(c(x_1)) = 0
   POL(s(x_1)) = 1 + x_1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))


----------------------------------------

(16)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   S(c(x1)) -> B(a(b(a(x1))))

The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(17) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
----------------------------------------

(18)
TRUE

----------------------------------------

(19)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   A(a(b(a(x1)))) -> A(b(a(b(x1))))

The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(20) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   A(a(b(a(x1)))) -> A(b(a(b(x1))))
The remaining pairs can at least be oriented weakly.
Used ordering:  Polynomial interpretation [POLO]:

   POL(A(x_1)) = x_1
   POL(a(x_1)) = 1
   POL(b(x_1)) = 0
   POL(c(x_1)) = 0
   POL(s(x_1)) = x_1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   b(b(a(b(x1)))) -> s(c(x1))
   s(c(x1)) -> b(a(b(a(x1))))


----------------------------------------

(21)
Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(22) PisEmptyProof (EQUIVALENT)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
----------------------------------------

(23)
YES

----------------------------------------

(24)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   S(b(a(b(x1)))) -> S(b(a(x1)))
   S(a(x1)) -> S(x1)

The TRS R consists of the following rules:

   s(a(x1)) -> a(s(x1))
   s(b(a(b(x1)))) -> a(s(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))
   s(c(x1)) -> b(a(b(a(x1))))
   a(a(b(a(x1)))) -> a(b(a(b(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(25) UsableRulesProof (EQUIVALENT)
We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.
----------------------------------------

(26)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   S(b(a(b(x1)))) -> S(b(a(x1)))
   S(a(x1)) -> S(x1)

The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(27) MRRProof (EQUIVALENT)
By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.

Strictly oriented dependency pairs:

   S(b(a(b(x1)))) -> S(b(a(x1)))
   S(a(x1)) -> S(x1)


Used ordering: Polynomial interpretation [POLO]:

   POL(S(x_1)) = 2*x_1
   POL(a(x_1)) = 1 + x_1
   POL(b(x_1)) = 1 + x_1
   POL(c(x_1)) = 3 + x_1
   POL(s(x_1)) = 1 + x_1


----------------------------------------

(28)
Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:

   a(a(b(a(x1)))) -> a(b(a(b(x1))))
   s(c(x1)) -> b(a(b(a(x1))))
   b(b(a(b(x1)))) -> s(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(29) PisEmptyProof (EQUIVALENT)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
----------------------------------------

(30)
YES