13.09/4.16 2019-03-29 10:41:00 13.09/4.16 Full thread dump Java HotSpot(TM) 64-Bit Server VM (25.144-b01 mixed mode): 13.09/4.16 13.09/4.16 "process reaper" #95 daemon prio=10 os_prio=0 tid=0x00002b4c5c024000 nid=0x2d3e runnable [0x00002b4be7d9c000] 13.09/4.16 java.lang.Thread.State: TIMED_WAITING (parking) 13.09/4.16 at sun.misc.Unsafe.park(Native Method) 13.09/4.16 - parking to wait for <0x0000000441916130> (a java.util.concurrent.SynchronousQueue$TransferStack) 13.09/4.16 at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) 13.09/4.16 at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "process reaper" #94 daemon prio=10 os_prio=0 tid=0x00002b4c6806f800 nid=0x2d3d waiting on condition [0x00002b4be7d63000] 13.09/4.16 java.lang.Thread.State: TIMED_WAITING (parking) 13.09/4.16 at sun.misc.Unsafe.park(Native Method) 13.09/4.16 - parking to wait for <0x0000000441916130> (a java.util.concurrent.SynchronousQueue$TransferStack) 13.09/4.16 at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) 13.09/4.16 at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "process reaper" #93 daemon prio=10 os_prio=0 tid=0x00002b4ca8001800 nid=0x2d3a waiting on condition [0x00002b4be7d2a000] 13.09/4.16 java.lang.Thread.State: TIMED_WAITING (parking) 13.09/4.16 at sun.misc.Unsafe.park(Native Method) 13.09/4.16 - parking to wait for <0x0000000441916130> (a java.util.concurrent.SynchronousQueue$TransferStack) 13.09/4.16 at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) 13.09/4.16 at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "process reaper" #92 daemon prio=10 os_prio=0 tid=0x00002b4c98001800 nid=0x2d34 runnable [0x0000000000000000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 13.09/4.16 "ThreadPoolThread59" #87 daemon prio=6 os_prio=0 tid=0x00002b4c4c02b000 nid=0x2d15 runnable [0x00002b4be76b4000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doOneNarrowingStep(NonTerminationProcessor.java:400) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doClosure(NonTerminationProcessor.java:341) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doHeuristic(NonTerminationProcessor.java:284) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.processQDPProblem(NonTerminationProcessor.java:262) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor.processQDPProblem(NonTerminationProcessor.java:107) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread58" #86 daemon prio=6 os_prio=0 tid=0x00002b4c4c029800 nid=0x2d14 runnable [0x00002b4be53b1000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at org.sat4j.core.VecInt.copyTo(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.or(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.handleConstr(Unknown Source) 13.09/4.16 at org.sat4j.tools.DimacsArrayToDimacsConverter.parseInstance(Unknown Source) 13.09/4.16 at aprove.Framework.PropositionalLogic.FormulaToDimacsConverter.convert(FormulaToDimacsConverter.java:117) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:137) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:268) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread57" #85 daemon prio=6 os_prio=0 tid=0x00002b4c4c01e000 nid=0x2d13 runnable [0x00002b4be6b6f000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.xor2Clause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.xor(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.handleConstr(Unknown Source) 13.09/4.16 at org.sat4j.tools.DimacsArrayToDimacsConverter.parseInstance(Unknown Source) 13.09/4.16 at aprove.Framework.PropositionalLogic.FormulaToDimacsConverter.convert(FormulaToDimacsConverter.java:117) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:137) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161) 13.09/4.16 at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread56" #84 daemon prio=6 os_prio=0 tid=0x00002b4c4c01d000 nid=0x2d12 runnable [0x00002b4be62be000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:450) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:347) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) 13.09/4.16 at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:158) 13.09/4.16 at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread55" #83 daemon prio=6 os_prio=0 tid=0x00002b4c4c019000 nid=0x2d11 runnable [0x00002b4be66c2000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.Object.hashCode(Native Method) 13.09/4.16 at java.util.AbstractSet.hashCode(AbstractSet.java:126) 13.09/4.16 at java.util.HashMap.hash(HashMap.java:338) 13.09/4.16 at java.util.HashMap.get(HashMap.java:556) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.times(FullSharingFactory.java:250) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.times(FullSharingFactory.java:26) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Rings.SimpleGPolyFlatRing.times(SimpleGPolyFlatRing.java:150) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Rings.SimpleGPolyFlatRing.times(SimpleGPolyFlatRing.java:32) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FlatteningVisitor.caseTimesNode(FlatteningVisitor.java:206) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FlatteningVisitor.caseTimesNode(FlatteningVisitor.java:28) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.TimesNode.visit(TimesNode.java:71) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:66) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.TimesNode.visit(TimesNode.java:69) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:66) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.TimesNode.visit(TimesNode.java:69) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:66) 13.09/4.16 at aprove.DPFramework.Orders.Utility.GPOLO.OrderPoly.visit(OrderPoly.java:157) 13.09/4.16 at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.transformConstraint(ExoticPolyMatrixInterpretation.java:364) 13.09/4.16 at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.fromTermConstraints(ExoticPolyMatrixInterpretation.java:319) 13.09/4.16 at aprove.DPFramework.Orders.Utility.PMATRO.AbstractPolyMatrixInterpretation.getActiveRuleConstraints(AbstractPolyMatrixInterpretation.java:320) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:233) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread54" #82 daemon prio=6 os_prio=0 tid=0x00002b4c4c00c800 nid=0x2d10 runnable [0x00002b4be74b1000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:485) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:268) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161) 13.09/4.16 at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread53" #81 daemon prio=6 os_prio=0 tid=0x00002b4c4c01c800 nid=0x2d0f runnable [0x00002b4be67c3000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.processClause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.xor2Clause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.xor2Clause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.xor2Clause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.xor(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.handleConstr(Unknown Source) 13.09/4.16 at org.sat4j.tools.DimacsArrayToDimacsConverter.parseInstance(Unknown Source) 13.09/4.16 at aprove.Framework.PropositionalLogic.FormulaToDimacsConverter.convert(FormulaToDimacsConverter.java:117) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:137) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:268) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread52" #80 daemon prio=6 os_prio=0 tid=0x00002b4c4c00b800 nid=0x2d0e runnable [0x00002b4be63bf000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:450) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:347) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) 13.09/4.16 at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:158) 13.09/4.16 at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread51" #79 daemon prio=6 os_prio=0 tid=0x00002b4c4c017000 nid=0x2d0d runnable [0x00002b4be65c1000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.processSubstitution(TRSCompoundTerm.java:46) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:40) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:15) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.processSubstitution(TRSCompoundTerm.java:48) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:40) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:15) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.processSubstitution(TRSCompoundTerm.java:48) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:40) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:15) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.processSubstitution(TRSCompoundTerm.java:48) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:40) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSCompoundTerm.applySubstitution(TRSCompoundTerm.java:15) 13.09/4.16 at aprove.DPFramework.BasicStructures.Unification.Unification.checkPropernessOfMgu(Unification.java:319) 13.09/4.16 at aprove.DPFramework.BasicStructures.Unification.Unification.getMgu(Unification.java:125) 13.09/4.16 at aprove.DPFramework.BasicStructures.TRSTerm.getMGU(TRSTerm.java:397) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doOneNarrowingStep(NonTerminationProcessor.java:425) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doClosure(NonTerminationProcessor.java:341) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.doHeuristic(NonTerminationProcessor.java:284) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor$NonTerminationProcedure.processQDPProblem(NonTerminationProcessor.java:262) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.NonTerminationProcessor.processQDPProblem(NonTerminationProcessor.java:107) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread50" #78 daemon prio=6 os_prio=0 tid=0x00002b4c4c028000 nid=0x2d0c runnable [0x00002b4be75b2000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.util.HashMap.resize(HashMap.java:734) 13.09/4.16 at java.util.HashMap.putVal(HashMap.java:662) 13.09/4.16 at java.util.HashMap.put(HashMap.java:611) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.times(FullSharingFactory.java:253) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.times(FullSharingFactory.java:26) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Rings.SimpleGPolyFlatRing.times(SimpleGPolyFlatRing.java:150) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Rings.SimpleGPolyFlatRing.times(SimpleGPolyFlatRing.java:32) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FlatteningVisitor.caseTimesNode(FlatteningVisitor.java:206) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FlatteningVisitor.caseTimesNode(FlatteningVisitor.java:28) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.TimesNode.visit(TimesNode.java:71) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:63) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) 13.09/4.16 at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:66) 13.09/4.16 at aprove.DPFramework.Orders.Utility.GPOLO.OrderPoly.visit(OrderPoly.java:157) 13.09/4.16 at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.transformConstraint(ExoticPolyMatrixInterpretation.java:364) 13.09/4.16 at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.fromTermConstraints(ExoticPolyMatrixInterpretation.java:319) 13.09/4.16 at aprove.DPFramework.Orders.Utility.PMATRO.AbstractPolyMatrixInterpretation.getActiveRuleConstraints(AbstractPolyMatrixInterpretation.java:320) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:233) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread47" #75 daemon prio=6 os_prio=0 tid=0x00002b4c4c021000 nid=0x2d09 runnable [0x00002b4be72af000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:485) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:268) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:268) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread46" #74 daemon prio=6 os_prio=0 tid=0x00002b4c4c01f800 nid=0x2d08 runnable [0x00002b4be71ae000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.io.FileInputStream.readBytes(Native Method) 13.09/4.16 at java.io.FileInputStream.read(FileInputStream.java:255) 13.09/4.16 at java.io.BufferedInputStream.read1(BufferedInputStream.java:284) 13.09/4.16 at java.io.BufferedInputStream.read(BufferedInputStream.java:345) 13.09/4.16 - locked <0x00000006ae41bbf0> (a java.lang.UNIXProcess$ProcessPipeInputStream) 13.09/4.16 at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284) 13.09/4.16 at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326) 13.09/4.16 at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178) 13.09/4.16 - locked <0x00000006ae41fdd0> (a java.io.InputStreamReader) 13.09/4.16 at java.io.InputStreamReader.read(InputStreamReader.java:184) 13.09/4.16 at java.io.BufferedReader.fill(BufferedReader.java:161) 13.09/4.16 at java.io.BufferedReader.readLine(BufferedReader.java:324) 13.09/4.16 - locked <0x00000006ae41fdd0> (a java.io.InputStreamReader) 13.09/4.16 at java.io.BufferedReader.readLine(BufferedReader.java:389) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:68) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) 13.09/4.16 at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:158) 13.09/4.16 at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread42" #70 daemon prio=6 os_prio=0 tid=0x00002b4c4c01b000 nid=0x2d04 runnable [0x00002b4be6eab000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:450) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:347) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) 13.09/4.16 at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:330) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread35" #63 daemon prio=6 os_prio=0 tid=0x00002b4c4c010800 nid=0x2cfd runnable [0x00002b4be6daa000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:450) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:347) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:112) 13.09/4.16 at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:330) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread34" #62 daemon prio=6 os_prio=0 tid=0x00002b4c4c014000 nid=0x2cfc runnable [0x00002b4be70ad000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:450) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:347) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATExtStartedFileChecker.found(MiniSATExtStartedFileChecker.java:64) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.(MiniSATFileChecker.java:114) 13.09/4.16 at aprove.GraphUserInterface.Factories.Solvers.Engines.MINISATEngine.getSATChecker(MINISATEngine.java:54) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:264) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:229) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:201) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPNegPoloSolver.solveQActive(QDPNegPoloSolver.java:89) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread33" #61 daemon prio=6 os_prio=0 tid=0x00002b4c4c00e800 nid=0x2cfb runnable [0x00002b4be57b4000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at org.sat4j.core.VecInt.(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.iff2Clause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.iff2Clause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.iff2Clause(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.iff(Unknown Source) 13.09/4.16 at org.sat4j.tools.ExtendedDimacsArrayToDimacsConverter.handleConstr(Unknown Source) 13.09/4.16 at org.sat4j.tools.DimacsArrayToDimacsConverter.parseInstance(Unknown Source) 13.09/4.16 at aprove.Framework.PropositionalLogic.FormulaToDimacsConverter.convert(FormulaToDimacsConverter.java:117) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:137) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161) 13.09/4.16 at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread32" #60 daemon prio=6 os_prio=0 tid=0x00002b4c4c012000 nid=0x2cfa runnable [0x00002b4be6fac000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at java.lang.UNIXProcess.forkAndExec(Native Method) 13.09/4.16 at java.lang.UNIXProcess.(UNIXProcess.java:247) 13.09/4.16 at java.lang.ProcessImpl.start(ProcessImpl.java:134) 13.09/4.16 at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:620) 13.09/4.16 at java.lang.Runtime.exec(Runtime.java:485) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:268) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:206) 13.09/4.16 at aprove.Framework.PropositionalLogic.SATCheckers.MiniSATFileChecker.solve(MiniSATFileChecker.java:153) 13.09/4.16 at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:161) 13.09/4.16 at aprove.Framework.Algebra.Orders.Utility.POLO.SimplifyingSearch.search(SimplifyingSearch.java:156) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:294) 13.09/4.16 at aprove.DPFramework.Orders.Solvers.POLOSolver.solve(POLOSolver.java:191) 13.09/4.16 at aprove.DPFramework.DPProblem.Solvers.QDPPoloSolver.solveQActive(QDPPoloSolver.java:94) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPReductionPairProcessor.processQDPProblem(QDPReductionPairProcessor.java:200) 13.09/4.16 at aprove.DPFramework.DPProblem.Processors.QDPProblemProcessor.process(QDPProblemProcessor.java:47) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "process reaper" #38 daemon prio=10 os_prio=0 tid=0x00002b4c6c006800 nid=0x2ce1 waiting on condition [0x00002b4be6ba9000] 13.09/4.16 java.lang.Thread.State: TIMED_WAITING (parking) 13.09/4.16 at sun.misc.Unsafe.park(Native Method) 13.09/4.16 - parking to wait for <0x0000000441916130> (a java.util.concurrent.SynchronousQueue$TransferStack) 13.09/4.16 at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) 13.09/4.16 at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "process reaper" #35 daemon prio=10 os_prio=0 tid=0x00002b4c60001800 nid=0x2cde waiting for monitor entry [0x00002b4be6a6f000] 13.09/4.16 java.lang.Thread.State: BLOCKED (on object monitor) 13.09/4.16 at java.lang.UNIXProcess$ProcessPipeInputStream.processExited(UNIXProcess.java:527) 13.09/4.16 - locked <0x00000006b737d1f0> (a java.lang.UNIXProcess$ProcessPipeInputStream) 13.09/4.16 at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:298) 13.09/4.16 at java.lang.UNIXProcess$$Lambda$13/1390678216.run(Unknown Source) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "process reaper" #34 daemon prio=10 os_prio=0 tid=0x00002b4c70001000 nid=0x2cdd waiting for monitor entry [0x00002b4be6a36000] 13.09/4.16 java.lang.Thread.State: BLOCKED (on object monitor) 13.09/4.16 at java.lang.UNIXProcess$ProcessPipeInputStream.processExited(UNIXProcess.java:527) 13.09/4.16 - waiting to lock <0x00000006ae41bbf0> (a java.lang.UNIXProcess$ProcessPipeInputStream) 13.09/4.16 at java.lang.UNIXProcess.lambda$initStreams$3(UNIXProcess.java:298) 13.09/4.16 at java.lang.UNIXProcess$$Lambda$13/1390678216.run(Unknown Source) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "process reaper" #32 daemon prio=10 os_prio=0 tid=0x00002b4c58022800 nid=0x2cdb waiting on condition [0x00002b4be69fd000] 13.09/4.16 java.lang.Thread.State: TIMED_WAITING (parking) 13.09/4.16 at sun.misc.Unsafe.park(Native Method) 13.09/4.16 - parking to wait for <0x0000000441916130> (a java.util.concurrent.SynchronousQueue$TransferStack) 13.09/4.16 at java.util.concurrent.locks.LockSupport.parkNanos(LockSupport.java:215) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.awaitFulfill(SynchronousQueue.java:460) 13.09/4.16 at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:362) 13.09/4.16 at java.util.concurrent.SynchronousQueue.poll(SynchronousQueue.java:941) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.getTask(ThreadPoolExecutor.java:1073) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1134) 13.09/4.16 at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread8" #20 daemon prio=6 os_prio=0 tid=0x00002b4c4c00a800 nid=0x2ccb runnable [0x00002b4be56b3000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at aprove.Framework.TreeAutomaton.TreeAutomaton.epsTransClosure(TreeAutomaton.java:468) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:288) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.createStateSubstitutions(TRSBoundsTA.java:256) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.collectAllCompatibleConflicts(TRSBounds.java:1666) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.createCompatibleTA(TRSBounds.java:693) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.getCertificate(TRSBounds.java:517) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.QTRSRoofMatchBoundsTAProcessor.processQTRS(QTRSRoofMatchBoundsTAProcessor.java:90) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "TimeRefresherThread" #19 daemon prio=6 os_prio=0 tid=0x00002b4c4c009800 nid=0x2cca waiting on condition [0x00002b4be55b3000] 13.09/4.16 java.lang.Thread.State: TIMED_WAITING (sleeping) 13.09/4.16 at java.lang.Thread.sleep(Native Method) 13.09/4.16 at aprove.Strategies.Abortions.TimeRefresher$TimeRefresherThread.run(TimeRefresher.java:55) 13.09/4.16 13.09/4.16 "DefaultMachine" #18 daemon prio=6 os_prio=0 tid=0x00002b4bc87eb800 nid=0x2cc9 waiting on condition [0x00002b4be54b2000] 13.09/4.16 java.lang.Thread.State: WAITING (parking) 13.09/4.16 at sun.misc.Unsafe.park(Native Method) 13.09/4.16 - parking to wait for <0x0000000440013660> (a java.util.concurrent.locks.AbstractQueuedSynchronizer$ConditionObject) 13.09/4.16 at java.util.concurrent.locks.LockSupport.park(LockSupport.java:175) 13.09/4.16 at java.util.concurrent.locks.AbstractQueuedSynchronizer$ConditionObject.await(AbstractQueuedSynchronizer.java:2039) 13.09/4.16 at java.util.concurrent.LinkedBlockingQueue.take(LinkedBlockingQueue.java:442) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.impl.DefaultMachine.run(DefaultMachine.java:169) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread2" #12 daemon prio=5 os_prio=0 tid=0x00002b4bc827c800 nid=0x2cc3 runnable [0x00002b4be52af000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.OverlapClosure.selfEmbedding(OverlapClosure.java:318) 13.09/4.16 at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.testAndInsert(NonLoopFinder.java:167) 13.09/4.16 at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.findNonLoop(NonLoopFinder.java:138) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.SRSNonLoopProcessor.processQTRS(SRSNonLoopProcessor.java:69) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread1" #11 daemon prio=5 os_prio=0 tid=0x00002b4bc8276800 nid=0x2cc2 runnable [0x00002b4be51ae000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at immutables.Immutable.ImmutableIterator.hasNext(Unknown Source) 13.09/4.16 at immutables.Immutable.ImmutableListIterator.hasNext(Unknown Source) 13.09/4.16 at java.util.AbstractList.equals(AbstractList.java:520) 13.09/4.16 at immutables.Immutable.ImmutableArrayList.equals(Unknown Source) 13.09/4.16 at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.StringPattern.equals(StringPattern.java:68) 13.09/4.16 at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.OverlapClosure.equals(OverlapClosure.java:104) 13.09/4.16 at java.util.HashMap.getNode(HashMap.java:571) 13.09/4.16 at java.util.HashMap.containsKey(HashMap.java:595) 13.09/4.16 at java.util.HashSet.contains(HashSet.java:203) 13.09/4.16 at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.testAndInsert(NonLoopFinder.java:181) 13.09/4.16 at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.NonLoopFinder.findNonLoop(NonLoopFinder.java:143) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.SRSNonLoopProcessor.processQTRS(SRSNonLoopProcessor.java:69) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "ThreadPoolThread0" #10 daemon prio=5 os_prio=0 tid=0x00002b4bc8275000 nid=0x2cc1 runnable [0x00002b4be50ad000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 at immutables.Immutable.ImmutableIterator.next(Unknown Source) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:300) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:332) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:304) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.createStateSubstitutions(TRSBoundsTA.java:256) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.collectAllCompatibleConflicts(TRSBounds.java:1666) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.createCompatibleTA(TRSBounds.java:693) 13.09/4.16 at aprove.DPFramework.BasicStructures.Matchbounds.TRSBounds.getCertificate(TRSBounds.java:517) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.QTRSRoofMatchBoundsTAProcessor.processQTRS(QTRSRoofMatchBoundsTAProcessor.java:90) 13.09/4.16 at aprove.DPFramework.TRSProblem.Processors.QTRSProcessor.process(QTRSProcessor.java:34) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor.execute(Executor.java:326) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.Executor$Runner.wrappedRun(Executor.java:377) 13.09/4.16 at aprove.Strategies.Abortions.PooledJob.run(PooledJob.java:99) 13.09/4.16 at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:274) 13.09/4.16 at java.lang.Thread.run(Thread.java:748) 13.09/4.16 13.09/4.16 "Service Thread" #8 daemon prio=9 os_prio=0 tid=0x00002b4bc8187800 nid=0x2cbf runnable [0x0000000000000000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 13.09/4.16 "C1 CompilerThread2" #7 daemon prio=9 os_prio=0 tid=0x00002b4bc8184000 nid=0x2cbe runnable [0x0000000000000000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 13.09/4.16 "C2 CompilerThread1" #6 daemon prio=9 os_prio=0 tid=0x00002b4bc8182000 nid=0x2cbd runnable [0x0000000000000000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 13.09/4.16 "C2 CompilerThread0" #5 daemon prio=9 os_prio=0 tid=0x00002b4bc817f800 nid=0x2cbc runnable [0x0000000000000000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 13.09/4.16 "Signal Dispatcher" #4 daemon prio=9 os_prio=0 tid=0x00002b4bc817e000 nid=0x2cbb waiting on condition [0x0000000000000000] 13.09/4.16 java.lang.Thread.State: RUNNABLE 13.09/4.16 13.09/4.16 "Finalizer" #3 daemon prio=8 os_prio=0 tid=0x00002b4bc814a000 nid=0x2cba in Object.wait() [0x00002b4be4806000] 13.09/4.16 java.lang.Thread.State: WAITING (on object monitor) 13.09/4.16 at java.lang.Object.wait(Native Method) 13.09/4.16 - waiting on <0x0000000441c27c30> (a java.lang.ref.ReferenceQueue$Lock) 13.09/4.16 at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:143) 13.09/4.16 - locked <0x0000000441c27c30> (a java.lang.ref.ReferenceQueue$Lock) 13.09/4.16 at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:164) 13.09/4.16 at java.lang.ref.Finalizer$FinalizerThread.run(Finalizer.java:209) 13.09/4.16 13.09/4.16 "Reference Handler" #2 daemon prio=10 os_prio=0 tid=0x00002b4bc8145800 nid=0x2cb9 in Object.wait() [0x00002b4be4705000] 13.09/4.16 java.lang.Thread.State: WAITING (on object monitor) 13.09/4.16 at java.lang.Object.wait(Native Method) 13.09/4.16 - waiting on <0x000000044000a7f0> (a java.lang.ref.Reference$Lock) 13.09/4.16 at java.lang.Object.wait(Object.java:502) 13.09/4.16 at java.lang.ref.Reference.tryHandlePending(Reference.java:191) 13.09/4.16 - locked <0x000000044000a7f0> (a java.lang.ref.Reference$Lock) 13.09/4.16 at java.lang.ref.Reference$ReferenceHandler.run(Reference.java:153) 13.09/4.16 13.09/4.16 "main" #1 prio=5 os_prio=0 tid=0x00002b4bc8008800 nid=0x2cb2 in Object.wait() [0x00002b4bc3fd0000] 13.09/4.16 java.lang.Thread.State: WAITING (on object monitor) 13.09/4.16 at java.lang.Object.wait(Native Method) 13.09/4.16 - waiting on <0x0000000440013c50> (a aprove.Strategies.ExecutableStrategies.impl.Handle) 13.09/4.16 at java.lang.Object.wait(Object.java:502) 13.09/4.16 at aprove.Strategies.ExecutableStrategies.impl.Handle.waitForFinish(Handle.java:42) 13.09/4.16 - locked <0x0000000440013c50> (a aprove.Strategies.ExecutableStrategies.impl.Handle) 13.09/4.16 at aprove.Runtime.AProVE.waitForHandle(AProVE.java:32) 13.09/4.16 at aprove.Runtime.AProVE.run(AProVE.java:101) 13.09/4.16 at aprove.CommandLineInterface.Main.run(Main.java:94) 13.09/4.16 at aprove.CommandLineInterface.Main.doMain(Main.java:42) 13.09/4.16 at aprove.Main.doMain(Main.java:54) 13.09/4.16 at aprove.Main.main(Main.java:20) 13.09/4.16 13.09/4.16 "VM Thread" os_prio=0 tid=0x00002b4bc813e000 nid=0x2cb8 runnable 13.09/4.16 13.09/4.16 "GC task thread#0 (ParallelGC)" os_prio=0 tid=0x00002b4bc801e000 nid=0x2cb4 runnable 13.09/4.16 13.09/4.16 "GC task thread#1 (ParallelGC)" os_prio=0 tid=0x00002b4bc801f800 nid=0x2cb5 runnable 13.09/4.16 13.09/4.16 "GC task thread#2 (ParallelGC)" os_prio=0 tid=0x00002b4bc8021800 nid=0x2cb6 runnable 13.09/4.16 13.09/4.16 "GC task thread#3 (ParallelGC)" os_prio=0 tid=0x00002b4bc8023800 nid=0x2cb7 runnable 13.09/4.16 13.09/4.16 "VM Periodic Task Thread" os_prio=0 tid=0x00002b4bc818a000 nid=0x2cc0 waiting on condition 13.09/4.16 13.09/4.16 JNI global references: 382 13.09/4.16 13.17/4.16 Heap 13.17/4.16 PSYoungGen total 4281856K, used 872609K [0x0000000695580000, 0x00000007c0000000, 0x00000007c0000000) 13.17/4.16 eden space 3670528K, 23% used [0x0000000695580000,0x00000006ca9a8418,0x0000000775600000) 13.17/4.16 from space 611328K, 0% used [0x000000079ab00000,0x000000079ab00000,0x00000007c0000000) 13.17/4.16 to space 611328K, 0% used [0x0000000775600000,0x0000000775600000,0x000000079ab00000) 13.17/4.16 ParOldGen total 9786880K, used 61579K [0x0000000440000000, 0x0000000695580000, 0x0000000695580000) 13.17/4.16 object space 9786880K, 0% used [0x0000000440000000,0x0000000443c22e50,0x0000000695580000) 13.17/4.16 Metaspace used 21019K, capacity 21194K, committed 21504K, reserved 1069056K 13.17/4.16 class space used 2438K, capacity 2499K, committed 2560K, reserved 1048576K 13.17/4.16 21.64/6.36 YES 21.64/6.37 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 21.64/6.37 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 21.64/6.37 21.64/6.37 21.64/6.37 Termination w.r.t. Q of the given QTRS could be proven: 21.64/6.37 21.64/6.37 (0) QTRS 21.64/6.37 (1) QTRS Reverse [EQUIVALENT, 0 ms] 21.64/6.37 (2) QTRS 21.64/6.37 (3) FlatCCProof [EQUIVALENT, 0 ms] 21.64/6.37 (4) QTRS 21.64/6.37 (5) RootLabelingProof [EQUIVALENT, 0 ms] 21.64/6.37 (6) QTRS 21.64/6.37 (7) QTRSRRRProof [EQUIVALENT, 61 ms] 21.64/6.37 (8) QTRS 21.64/6.37 (9) DependencyPairsProof [EQUIVALENT, 48 ms] 21.64/6.37 (10) QDP 21.64/6.37 (11) DependencyGraphProof [EQUIVALENT, 2 ms] 21.64/6.37 (12) QDP 21.64/6.37 (13) QDPOrderProof [EQUIVALENT, 352 ms] 21.64/6.37 (14) QDP 21.64/6.37 (15) DependencyGraphProof [EQUIVALENT, 0 ms] 21.64/6.37 (16) QDP 21.64/6.37 (17) UsableRulesProof [EQUIVALENT, 0 ms] 21.64/6.37 (18) QDP 21.64/6.37 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 21.64/6.37 (20) YES 21.64/6.37 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (0) 21.64/6.37 Obligation: 21.64/6.37 Q restricted rewrite system: 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a(x1) -> b(c(x1)) 21.64/6.37 b(a(b(x1))) -> a(a(a(x1))) 21.64/6.37 c(c(x1)) -> a(x1) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (1) QTRS Reverse (EQUIVALENT) 21.64/6.37 We applied the QTRS Reverse Processor [REVERSE]. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (2) 21.64/6.37 Obligation: 21.64/6.37 Q restricted rewrite system: 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a(x1) -> c(b(x1)) 21.64/6.37 b(a(b(x1))) -> a(a(a(x1))) 21.64/6.37 c(c(x1)) -> a(x1) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (3) FlatCCProof (EQUIVALENT) 21.64/6.37 We used flat context closure [ROOTLAB] 21.64/6.37 As Q is empty the flat context closure was sound AND complete. 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (4) 21.64/6.37 Obligation: 21.64/6.37 Q restricted rewrite system: 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a(a(x1)) -> a(c(b(x1))) 21.64/6.37 c(a(x1)) -> c(c(b(x1))) 21.64/6.37 b(a(x1)) -> b(c(b(x1))) 21.64/6.37 a(b(a(b(x1)))) -> a(a(a(a(x1)))) 21.64/6.37 c(b(a(b(x1)))) -> c(a(a(a(x1)))) 21.64/6.37 b(b(a(b(x1)))) -> b(a(a(a(x1)))) 21.64/6.37 a(c(c(x1))) -> a(a(x1)) 21.64/6.37 c(c(c(x1))) -> c(a(x1)) 21.64/6.37 b(c(c(x1))) -> b(a(x1)) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (5) RootLabelingProof (EQUIVALENT) 21.64/6.37 We used plain root labeling [ROOTLAB] with the following heuristic: 21.64/6.37 LabelAll: All function symbols get labeled 21.64/6.37 21.64/6.37 As Q is empty the root labeling was sound AND complete. 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (6) 21.64/6.37 Obligation: 21.64/6.37 Q restricted rewrite system: 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a_{a_1}(a_{a_1}(x1)) -> a_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 a_{a_1}(a_{b_1}(x1)) -> a_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{a_1}(a_{a_1}(x1)) -> c_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 c_{a_1}(a_{b_1}(x1)) -> c_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 b_{a_1}(a_{a_1}(x1)) -> b_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 b_{a_1}(a_{c_1}(x1)) -> b_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 b_{a_1}(a_{b_1}(x1)) -> b_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 a_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 b_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 a_{c_1}(c_{c_1}(c_{a_1}(x1))) -> a_{a_1}(a_{a_1}(x1)) 21.64/6.37 a_{c_1}(c_{c_1}(c_{c_1}(x1))) -> a_{a_1}(a_{c_1}(x1)) 21.64/6.37 a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (7) QTRSRRRProof (EQUIVALENT) 21.64/6.37 Used ordering: 21.64/6.37 Polynomial interpretation [POLO]: 21.64/6.37 21.64/6.37 POL(a_{a_1}(x_1)) = x_1 21.64/6.37 POL(a_{b_1}(x_1)) = 1 + x_1 21.64/6.37 POL(a_{c_1}(x_1)) = x_1 21.64/6.37 POL(b_{a_1}(x_1)) = x_1 21.64/6.37 POL(b_{b_1}(x_1)) = 1 + x_1 21.64/6.37 POL(b_{c_1}(x_1)) = x_1 21.64/6.37 POL(c_{a_1}(x_1)) = 1 + x_1 21.64/6.37 POL(c_{b_1}(x_1)) = x_1 21.64/6.37 POL(c_{c_1}(x_1)) = 1 + x_1 21.64/6.37 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 21.64/6.37 21.64/6.37 a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 a_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 b_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 a_{c_1}(c_{c_1}(c_{a_1}(x1))) -> a_{a_1}(a_{a_1}(x1)) 21.64/6.37 a_{c_1}(c_{c_1}(c_{c_1}(x1))) -> a_{a_1}(a_{c_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) 21.64/6.37 21.64/6.37 21.64/6.37 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (8) 21.64/6.37 Obligation: 21.64/6.37 Q restricted rewrite system: 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a_{a_1}(a_{a_1}(x1)) -> a_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 a_{a_1}(a_{b_1}(x1)) -> a_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{a_1}(a_{a_1}(x1)) -> c_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 c_{a_1}(a_{b_1}(x1)) -> c_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 b_{a_1}(a_{a_1}(x1)) -> b_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 b_{a_1}(a_{c_1}(x1)) -> b_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 b_{a_1}(a_{b_1}(x1)) -> b_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (9) DependencyPairsProof (EQUIVALENT) 21.64/6.37 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (10) 21.64/6.37 Obligation: 21.64/6.37 Q DP problem: 21.64/6.37 The TRS P consists of the following rules: 21.64/6.37 21.64/6.37 A_{A_1}(a_{a_1}(x1)) -> A_{C_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 A_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 A_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 A_{A_1}(a_{c_1}(x1)) -> A_{C_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 A_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 A_{A_1}(a_{c_1}(x1)) -> B_{C_1}(x1) 21.64/6.37 A_{A_1}(a_{b_1}(x1)) -> A_{C_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 A_{A_1}(a_{b_1}(x1)) -> C_{B_1}(b_{b_1}(x1)) 21.64/6.37 C_{A_1}(a_{a_1}(x1)) -> C_{C_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 C_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 C_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 C_{A_1}(a_{c_1}(x1)) -> C_{C_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 C_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 C_{A_1}(a_{c_1}(x1)) -> B_{C_1}(x1) 21.64/6.37 C_{A_1}(a_{b_1}(x1)) -> C_{C_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 C_{A_1}(a_{b_1}(x1)) -> C_{B_1}(b_{b_1}(x1)) 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> B_{C_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 B_{A_1}(a_{c_1}(x1)) -> B_{C_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 B_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 B_{A_1}(a_{c_1}(x1)) -> B_{C_1}(x1) 21.64/6.37 B_{A_1}(a_{b_1}(x1)) -> B_{C_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 B_{A_1}(a_{b_1}(x1)) -> C_{B_1}(b_{b_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{a_1}(x1))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(x1) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{c_1}(x1))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> A_{A_1}(a_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> A_{C_1}(x1) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{b_1}(x1))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{b_1}(x1)) 21.64/6.37 A_{C_1}(c_{c_1}(c_{b_1}(x1))) -> A_{A_1}(a_{b_1}(x1)) 21.64/6.37 C_{C_1}(c_{c_1}(c_{b_1}(x1))) -> C_{A_1}(a_{b_1}(x1)) 21.64/6.37 B_{C_1}(c_{c_1}(c_{b_1}(x1))) -> B_{A_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a_{a_1}(a_{a_1}(x1)) -> a_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 a_{a_1}(a_{b_1}(x1)) -> a_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{a_1}(a_{a_1}(x1)) -> c_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 c_{a_1}(a_{b_1}(x1)) -> c_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 b_{a_1}(a_{a_1}(x1)) -> b_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 b_{a_1}(a_{c_1}(x1)) -> b_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 b_{a_1}(a_{b_1}(x1)) -> b_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 We have to consider all minimal (P,Q,R)-chains. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (11) DependencyGraphProof (EQUIVALENT) 21.64/6.37 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 20 less nodes. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (12) 21.64/6.37 Obligation: 21.64/6.37 Q DP problem: 21.64/6.37 The TRS P consists of the following rules: 21.64/6.37 21.64/6.37 A_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 C_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{a_1}(x1))) 21.64/6.37 A_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(x1)) 21.64/6.37 A_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(x1) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 C_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 B_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{c_1}(x1))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> A_{A_1}(a_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 C_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{b_1}(x1))) 21.64/6.37 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a_{a_1}(a_{a_1}(x1)) -> a_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 a_{a_1}(a_{b_1}(x1)) -> a_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{a_1}(a_{a_1}(x1)) -> c_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 c_{a_1}(a_{b_1}(x1)) -> c_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 b_{a_1}(a_{a_1}(x1)) -> b_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 b_{a_1}(a_{c_1}(x1)) -> b_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 b_{a_1}(a_{b_1}(x1)) -> b_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 We have to consider all minimal (P,Q,R)-chains. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (13) QDPOrderProof (EQUIVALENT) 21.64/6.37 We use the reduction pair processor [LPAR04,JAR06]. 21.64/6.37 21.64/6.37 21.64/6.37 The following pairs can be oriented strictly and are deleted. 21.64/6.37 21.64/6.37 A_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 A_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 A_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> C_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 The remaining pairs can at least be oriented weakly. 21.64/6.37 Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation: 21.64/6.37 21.64/6.37 POL( C_{B_1}_1(x_1) ) = max{0, x_1 - 2} 21.64/6.37 POL( A_{A_1}_1(x_1) ) = x_1 + 1 21.64/6.37 POL( a_{c_1}_1(x_1) ) = x_1 21.64/6.37 POL( c_{b_1}_1(x_1) ) = max{0, x_1 - 1} 21.64/6.37 POL( C_{A_1}_1(x_1) ) = x_1 21.64/6.37 POL( b_{a_1}_1(x_1) ) = x_1 + 1 21.64/6.37 POL( a_{a_1}_1(x_1) ) = x_1 21.64/6.37 POL( b_{c_1}_1(x_1) ) = x_1 + 1 21.64/6.37 POL( a_{b_1}_1(x_1) ) = x_1 + 1 21.64/6.37 POL( b_{b_1}_1(x_1) ) = x_1 + 2 21.64/6.37 POL( c_{a_1}_1(x_1) ) = x_1 + 2 21.64/6.37 POL( c_{c_1}_1(x_1) ) = x_1 + 2 21.64/6.37 POL( B_{A_1}_1(x_1) ) = x_1 21.64/6.37 21.64/6.37 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 21.64/6.37 21.64/6.37 b_{a_1}(a_{a_1}(x1)) -> b_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 b_{a_1}(a_{c_1}(x1)) -> b_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 b_{a_1}(a_{b_1}(x1)) -> b_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 a_{a_1}(a_{a_1}(x1)) -> a_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 a_{a_1}(a_{b_1}(x1)) -> a_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 b_{c_1}(c_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) 21.64/6.37 a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 c_{a_1}(a_{a_1}(x1)) -> c_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 c_{a_1}(a_{b_1}(x1)) -> c_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{c_1}(c_{c_1}(c_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (14) 21.64/6.37 Obligation: 21.64/6.37 Q DP problem: 21.64/6.37 The TRS P consists of the following rules: 21.64/6.37 21.64/6.37 C_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{a_1}(x1))) 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> C_{B_1}(b_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(x1) 21.64/6.37 C_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 B_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{c_1}(x1))) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> A_{A_1}(a_{c_1}(x1)) 21.64/6.37 C_{A_1}(a_{c_1}(x1)) -> C_{B_1}(b_{c_1}(x1)) 21.64/6.37 C_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{b_1}(x1))) 21.64/6.37 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a_{a_1}(a_{a_1}(x1)) -> a_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 a_{a_1}(a_{b_1}(x1)) -> a_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{a_1}(a_{a_1}(x1)) -> c_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 c_{a_1}(a_{b_1}(x1)) -> c_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 b_{a_1}(a_{a_1}(x1)) -> b_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 b_{a_1}(a_{c_1}(x1)) -> b_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 b_{a_1}(a_{b_1}(x1)) -> b_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 We have to consider all minimal (P,Q,R)-chains. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (15) DependencyGraphProof (EQUIVALENT) 21.64/6.37 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 11 less nodes. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (16) 21.64/6.37 Obligation: 21.64/6.37 Q DP problem: 21.64/6.37 The TRS P consists of the following rules: 21.64/6.37 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 21.64/6.37 The TRS R consists of the following rules: 21.64/6.37 21.64/6.37 a_{a_1}(a_{a_1}(x1)) -> a_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 a_{a_1}(a_{b_1}(x1)) -> a_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{a_1}(a_{a_1}(x1)) -> c_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 c_{a_1}(a_{b_1}(x1)) -> c_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 b_{a_1}(a_{a_1}(x1)) -> b_{c_1}(c_{b_1}(b_{a_1}(x1))) 21.64/6.37 b_{a_1}(a_{c_1}(x1)) -> b_{c_1}(c_{b_1}(b_{c_1}(x1))) 21.64/6.37 b_{a_1}(a_{b_1}(x1)) -> b_{c_1}(c_{b_1}(b_{b_1}(x1))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{c_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) 21.64/6.37 c_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> c_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) 21.64/6.37 a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) 21.64/6.37 c_{c_1}(c_{c_1}(c_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) 21.64/6.37 b_{c_1}(c_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) 21.64/6.37 21.64/6.37 Q is empty. 21.64/6.37 We have to consider all minimal (P,Q,R)-chains. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (17) UsableRulesProof (EQUIVALENT) 21.64/6.37 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. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (18) 21.64/6.37 Obligation: 21.64/6.37 Q DP problem: 21.64/6.37 The TRS P consists of the following rules: 21.64/6.37 21.64/6.37 B_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 21.64/6.37 R is empty. 21.64/6.37 Q is empty. 21.64/6.37 We have to consider all minimal (P,Q,R)-chains. 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (19) QDPSizeChangeProof (EQUIVALENT) 21.64/6.37 By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 21.64/6.37 21.64/6.37 From the DPs we obtained the following set of size-change graphs: 21.64/6.37 *B_{A_1}(a_{a_1}(x1)) -> B_{A_1}(x1) 21.64/6.37 The graph contains the following edges 1 > 1 21.64/6.37 21.64/6.37 21.64/6.37 ---------------------------------------- 21.64/6.37 21.64/6.37 (20) 21.64/6.37 YES 21.79/6.45 EOF