2020-06-23 17:50:30 Full thread dump Java HotSpot(TM) 64-Bit Server VM (25.144-b01 mixed mode): "ThreadPoolThread78" #109 daemon prio=6 os_prio=0 tid=0x00002ac814058800 nid=0xd9ff runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "ThreadPoolThread77" #108 daemon prio=6 os_prio=0 tid=0x00002ac814056800 nid=0xd9fb waiting for monitor entry [0x00002ac7eb839000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread76" #107 daemon prio=6 os_prio=0 tid=0x00002ac814054800 nid=0xd9ee waiting for monitor entry [0x00002ac7eb738000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread75" #106 daemon prio=6 os_prio=0 tid=0x00002ac814052800 nid=0xd9ed waiting for monitor entry [0x00002ac7eb637000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread74" #105 daemon prio=6 os_prio=0 tid=0x00002ac814051000 nid=0xd9ec waiting for monitor entry [0x00002ac7eb536000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread73" #104 daemon prio=6 os_prio=0 tid=0x00002ac81401c800 nid=0xd9eb waiting for monitor entry [0x00002ac7aefcb000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread72" #103 daemon prio=6 os_prio=0 tid=0x00002ac814015000 nid=0xd9ea waiting for monitor entry [0x00002ac7af0cc000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread71" #102 daemon prio=6 os_prio=0 tid=0x00002ac81404f000 nid=0xd9e9 waiting for monitor entry [0x00002ac7eb235000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread70" #101 daemon prio=6 os_prio=0 tid=0x00002ac81404d000 nid=0xd9e8 runnable [0x00002ac7eb133000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.forkAndExec(Native Method) at java.lang.UNIXProcess.(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.(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) "ThreadPoolThread69" #100 daemon prio=6 os_prio=0 tid=0x00002ac81404b000 nid=0xd9e7 runnable [0x00002ac7eb032000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.forkAndExec(Native Method) at java.lang.UNIXProcess.(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.(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.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) "ThreadPoolThread68" #99 daemon prio=6 os_prio=0 tid=0x00002ac814049800 nid=0xd9e6 runnable [0x00002ac7eaf30000] java.lang.Thread.State: RUNNABLE at sun.misc.Unsafe.unpark(Native Method) at java.util.concurrent.locks.LockSupport.unpark(LockSupport.java:141) at java.util.concurrent.SynchronousQueue$TransferStack$SNode.tryMatch(SynchronousQueue.java:265) at java.util.concurrent.SynchronousQueue$TransferStack.transfer(SynchronousQueue.java:383) at java.util.concurrent.SynchronousQueue.offer(SynchronousQueue.java:913) at java.util.concurrent.ThreadPoolExecutor.execute(ThreadPoolExecutor.java:1371) at java.lang.UNIXProcess.initStreams(UNIXProcess.java:288) at java.lang.UNIXProcess.lambda$new$2(UNIXProcess.java:258) at java.lang.UNIXProcess$$Lambda$11/781297238.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.lang.UNIXProcess.(UNIXProcess.java:257) 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.(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) "ThreadPoolThread67" #98 daemon prio=6 os_prio=0 tid=0x00002ac814047800 nid=0xd9e5 runnable [0x00002ac7eae30000] java.lang.Thread.State: RUNNABLE at java.util.LinkedHashMap$LinkedKeyIterator.next(LinkedHashMap.java:742) at java.util.AbstractSet.hashCode(AbstractSet.java:124) at java.util.HashMap.hash(HashMap.java:338) at java.util.HashMap.get(HashMap.java:556) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.times(FullSharingFactory.java:250) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.VarSubstitutionVisitor.caseConcatNode(VarSubstitutionVisitor.java:239) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.ConcatNode.visit(ConcatNode.java:170) at aprove.DPFramework.Orders.Utility.GPOLO.OrderPoly.visit(OrderPoly.java:157) at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:66) at aprove.DPFramework.Orders.Utility.GPOLO.OrderPoly.visit(OrderPoly.java:157) at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.PlusNode.visit(PlusNode.java:66) at aprove.DPFramework.Orders.Utility.GPOLO.OrderPoly.visit(OrderPoly.java:157) at aprove.Framework.Algebra.GeneralPolynomials.Visitors.GPolyVisitor.applyTo(GPolyVisitor.java:40) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.substituteVariables(FullSharingFactory.java:421) at aprove.DPFramework.Orders.Utility.GPOLO.OrderPolyFactory.substituteVariables(OrderPolyFactory.java:177) at aprove.Framework.Algebra.PolyMatrices.PolyMatrixFactory.substituteVariables(PolyMatrixFactory.java:403) at aprove.DPFramework.Orders.Utility.PMATRO.AbstractPolyMatrixInterpretation.interpretTerm(AbstractPolyMatrixInterpretation.java:287) at aprove.DPFramework.Orders.Utility.PMATRO.AbstractPolyMatrixInterpretation.interpretTerm(AbstractPolyMatrixInterpretation.java:277) at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.fromTermConstraints(ExoticPolyMatrixInterpretation.java:277) at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:235) 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) "ThreadPoolThread66" #97 daemon prio=6 os_prio=0 tid=0x00002ac814046000 nid=0xd9e4 waiting for monitor entry [0x00002ac7ead30000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread65" #96 daemon prio=6 os_prio=0 tid=0x00002ac814044000 nid=0xd9e3 runnable [0x00002ac7eac2e000] java.lang.Thread.State: RUNNABLE at aprove.Framework.PropositionalLogic.Formulae.NonCountingCircuitFactory.buildAnd(NonCountingCircuitFactory.java:47) at aprove.Framework.PropositionalLogic.Formulae.AbstractFormulaFactory.buildAnd(AbstractFormulaFactory.java:65) at aprove.Framework.Algebra.Polynomials.SatSearch.ArithmeticCircuitFactory.buildPlusCircuit(ArithmeticCircuitFactory.java:859) at aprove.Framework.Algebra.Polynomials.SatSearch.ArithmeticCircuitFactory.buildPlusCircuit(ArithmeticCircuitFactory.java:152) at aprove.Framework.Algebra.Polynomials.SatSearch.PlainSPCToCircuitConverter.convertPolyMap(PlainSPCToCircuitConverter.java:277) at aprove.Framework.Algebra.Polynomials.SatSearch.AbstractSPCToCircuitConverter.convertPolynomial(AbstractSPCToCircuitConverter.java:384) at aprove.Framework.Algebra.Polynomials.SatSearch.PlainSPCToCircuitConverter.convertConstraint(PlainSPCToCircuitConverter.java:82) at aprove.Framework.Algebra.Polynomials.SatSearch.AbstractSPCToCircuitConverter.convert(AbstractSPCToCircuitConverter.java:299) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:129) 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) "ThreadPoolThread64" #95 daemon prio=6 os_prio=0 tid=0x00002ac814042000 nid=0xd9e2 runnable [0x00002ac7eab2d000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.forkAndExec(Native Method) at java.lang.UNIXProcess.(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.(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) "ThreadPoolThread63" #94 daemon prio=6 os_prio=0 tid=0x00002ac814040800 nid=0xd9e1 runnable [0x00002ac7eaa2c000] java.lang.Thread.State: RUNNABLE at java.util.AbstractMap.putAll(AbstractMap.java:280) at java.util.TreeMap.putAll(TreeMap.java:327) at java.util.TreeMap.(TreeMap.java:185) at aprove.Framework.Algebra.Polynomials.SatSearch.AbstractSPCToCircuitConverter.convertPolynomial(AbstractSPCToCircuitConverter.java:383) at aprove.Framework.Algebra.Polynomials.SatSearch.PlainSPCToCircuitConverter.convertConstraint(PlainSPCToCircuitConverter.java:81) at aprove.Framework.Algebra.Polynomials.SatSearch.AbstractSPCToCircuitConverter.convert(AbstractSPCToCircuitConverter.java:284) at aprove.Framework.Algebra.Polynomials.SatSearch.SatSearch.search(SatSearch.java:129) 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) "ThreadPoolThread62" #93 daemon prio=6 os_prio=0 tid=0x00002ac81403e800 nid=0xd9e0 runnable [0x00002ac7ea92b000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.forkAndExec(Native Method) at java.lang.UNIXProcess.(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.(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) "ThreadPoolThread61" #92 daemon prio=6 os_prio=0 tid=0x00002ac81403c800 nid=0xd9df runnable [0x00002ac7ea82a000] java.lang.Thread.State: RUNNABLE at aprove.Framework.PropositionalLogic.Formulae.AbstractCircuitFactory.buildNot(AbstractCircuitFactory.java:71) at aprove.Framework.PropositionalLogic.Formulae.AbstractCircuitFactory.buildIff(AbstractCircuitFactory.java:101) at aprove.Framework.Algebra.GeneralPolynomials.SatSearch.ArcticInt.ArcticIntUnaryCircuitFactory.buildGTCircuit(ArcticIntUnaryCircuitFactory.java:60) at aprove.Framework.Algebra.GeneralPolynomials.SatSearch.CircuitFactory.buildGECircuit(CircuitFactory.java:74) at aprove.Framework.Algebra.GeneralPolynomials.SatSearch.OPCtoFormulaConverter.caseAtom(OPCtoFormulaConverter.java:223) at aprove.DPFramework.Orders.Utility.GPOLO.OPCAtom.visit(OPCAtom.java:122) at aprove.DPFramework.Orders.Utility.GPOLO.ConstraintVisitor$ConstraintVisitorSkeleton.applyTo(ConstraintVisitor.java:199) at aprove.DPFramework.Orders.Utility.GPOLO.OPCQuantifierA.visit(OPCQuantifierA.java:47) at aprove.DPFramework.Orders.Utility.GPOLO.ConstraintVisitor$ConstraintVisitorSkeleton.applyTo(ConstraintVisitor.java:199) at aprove.DPFramework.Orders.Utility.GPOLO.OPCAnd.visit(OPCAnd.java:80) at aprove.DPFramework.Orders.Utility.GPOLO.ConstraintVisitor$ConstraintVisitorSkeleton.applyTo(ConstraintVisitor.java:199) at aprove.DPFramework.Orders.Utility.GPOLO.OPCQuantifierE.visit(OPCQuantifierE.java:47) at aprove.DPFramework.Orders.Utility.GPOLO.ConstraintVisitor$ConstraintVisitorSkeleton.applyTo(ConstraintVisitor.java:199) at aprove.DPFramework.Orders.Utility.GPOLO.OPCAnd.visit(OPCAnd.java:80) at aprove.DPFramework.Orders.Utility.GPOLO.ConstraintVisitor$ConstraintVisitorSkeleton.applyTo(ConstraintVisitor.java:199) at aprove.Framework.Algebra.GeneralPolynomials.SatSearch.OPCtoFormulaConverter.applyToWithCleanup(OPCtoFormulaConverter.java:89) at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:282) 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) "ThreadPoolThread60" #91 daemon prio=6 os_prio=0 tid=0x00002ac81403a800 nid=0xd9de waiting for monitor entry [0x00002ac7ea72a000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread59" #90 daemon prio=6 os_prio=0 tid=0x00002ac814038800 nid=0xd9dd runnable [0x00002ac7ea628000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.forkAndExec(Native Method) at java.lang.UNIXProcess.(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.(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.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) "ThreadPoolThread58" #89 daemon prio=6 os_prio=0 tid=0x00002ac814036800 nid=0xd9dc runnable [0x00002ac7affda000] java.lang.Thread.State: RUNNABLE at java.util.AbstractMap.putAll(AbstractMap.java:280) at java.util.TreeMap.putAll(TreeMap.java:327) at java.util.TreeMap.(TreeMap.java:185) at aprove.Framework.Algebra.Polynomials.VarPolynomial.export(VarPolynomial.java:1353) at aprove.Framework.Algebra.Polynomials.VarPolynomial.toString(VarPolynomial.java:1263) at java.lang.String.valueOf(String.java:2994) at java.lang.StringBuilder.append(StringBuilder.java:131) at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.getInterpretation(NegPoloInterpretation.java:333) at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.interpret(NegPoloInterpretation.java:670) at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.encode(NegPoloInterpretation.java:454) at aprove.Framework.Algebra.Polynomials.SPCFormulae.NegPoloInterpretation.solve(NegPoloInterpretation.java:181) 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) "ThreadPoolThread57" #88 daemon prio=6 os_prio=0 tid=0x00002ac814034800 nid=0xd9db runnable [0x00002ac7afed9000] java.lang.Thread.State: RUNNABLE at java.util.HashSet.add(HashSet.java:219) at aprove.Framework.Algebra.Polynomials.VarPolynomial.getCoefficientsOfVariables(VarPolynomial.java:1027) at aprove.Framework.Algebra.Polynomials.VarPolyConstraint.addCoefficientConstraints(VarPolyConstraint.java:97) at aprove.Framework.Algebra.Polynomials.VarPolyConstraint.createCoefficientConstraints(VarPolyConstraint.java:72) at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:278) 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) "ThreadPoolThread56" #87 daemon prio=6 os_prio=0 tid=0x00002ac814032800 nid=0xd9da runnable [0x00002ac7afdd8000] java.lang.Thread.State: RUNNABLE at java.util.HashSet.add(HashSet.java:219) at aprove.Framework.Algebra.Polynomials.VarPolynomial.getCoefficientsOfVariables(VarPolynomial.java:1027) at aprove.Framework.Algebra.Polynomials.VarPolyConstraint.addCoefficientConstraints(VarPolyConstraint.java:97) at aprove.Framework.Algebra.Polynomials.VarPolyConstraint.createCoefficientConstraints(VarPolyConstraint.java:72) at aprove.DPFramework.Orders.Solvers.POLOSolver.actuallySolve(POLOSolver.java:278) 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) "ThreadPoolThread55" #86 daemon prio=6 os_prio=0 tid=0x00002ac814030800 nid=0xd9d9 runnable [0x00002ac7afcd7000] java.lang.Thread.State: RUNNABLE at java.lang.Object.getClass(Native Method) at aprove.Framework.Algebra.GeneralPolynomials.Variables.GAtomicVar.equals(GAtomicVar.java:130) at java.util.AbstractList.equals(AbstractList.java:523) at java.util.HashMap.putVal(HashMap.java:634) at java.util.HashMap.put(HashMap.java:611) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.buildVariable(FullSharingFactory.java:93) at aprove.Framework.Algebra.GeneralPolynomials.DAGNodes.FullSharingFactory.buildFromVariable(FullSharingFactory.java:446) at aprove.DPFramework.Orders.Utility.GPOLO.OrderPolyFactory.buildFromInnerVariable(OrderPolyFactory.java:202) at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.generateActiveConditions(ExoticPolyMatrixInterpretation.java:244) at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.getMatrixFromFunction(ExoticPolyMatrixInterpretation.java:202) at aprove.DPFramework.Orders.Utility.PMATRO.AbstractPolyMatrixInterpretation.extend(AbstractPolyMatrixInterpretation.java:196) at aprove.DPFramework.Orders.Utility.PMATRO.AbstractPolyMatrixInterpretation.extend(AbstractPolyMatrixInterpretation.java:209) at aprove.DPFramework.Orders.Utility.PMATRO.ExoticPolyMatrixInterpretation.create(ExoticPolyMatrixInterpretation.java:112) at aprove.DPFramework.DPProblem.Solvers.PMatroExoticSolver.solveQActive(PMatroExoticSolver.java:226) 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) "ThreadPoolThread54" #85 daemon prio=6 os_prio=0 tid=0x00002ac81402e800 nid=0xd9d8 waiting for monitor entry [0x00002ac7afbd7000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - locked <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread53" #84 daemon prio=6 os_prio=0 tid=0x00002ac81402c800 nid=0xd9d7 waiting for monitor entry [0x00002ac7afad6000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread52" #83 daemon prio=6 os_prio=0 tid=0x00002ac81402b000 nid=0xd9d6 waiting for monitor entry [0x00002ac7af9d5000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread51" #82 daemon prio=6 os_prio=0 tid=0x00002ac814028800 nid=0xd9d5 waiting for monitor entry [0x00002ac7af8d4000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread50" #81 daemon prio=6 os_prio=0 tid=0x00002ac814026800 nid=0xd9d4 waiting for monitor entry [0x00002ac7af7d3000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread49" #80 daemon prio=6 os_prio=0 tid=0x00002ac814025000 nid=0xd9d3 waiting for monitor entry [0x00002ac7af6d2000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread48" #79 daemon prio=6 os_prio=0 tid=0x00002ac814023000 nid=0xd9d2 waiting for monitor entry [0x00002ac7af5d1000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread47" #78 daemon prio=6 os_prio=0 tid=0x00002ac814021000 nid=0xd9d1 waiting for monitor entry [0x00002ac7af4d0000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread46" #77 daemon prio=6 os_prio=0 tid=0x00002ac814020000 nid=0xd9d0 waiting for monitor entry [0x00002ac7ad7b6000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread45" #76 daemon prio=6 os_prio=0 tid=0x00002ac81401f000 nid=0xd9cf waiting for monitor entry [0x00002ac7adab9000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread44" #75 daemon prio=6 os_prio=0 tid=0x00002ac81401e800 nid=0xd9ce waiting for monitor entry [0x00002ac7ae9c7000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread43" #74 daemon prio=6 os_prio=0 tid=0x00002ac81401d800 nid=0xd9cd waiting for monitor entry [0x00002ac7af2ce000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread42" #73 daemon prio=6 os_prio=0 tid=0x00002ac814007000 nid=0xd9cc waiting for monitor entry [0x00002ac7adebd000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread41" #72 daemon prio=6 os_prio=0 tid=0x00002ac81400d000 nid=0xd9cb waiting for monitor entry [0x00002ac7aeeca000] java.lang.Thread.State: BLOCKED (on object monitor) at aprove.Strategies.Util.PrioritizableThreadPool.fetchJob(PrioritizableThreadPool.java:312) - waiting to lock <0x0000000440001400> (a aprove.Strategies.Util.PrioritizableThreadPool) at aprove.Strategies.Util.PrioritizableThreadPool.access$300(PrioritizableThreadPool.java:24) at aprove.Strategies.Util.PrioritizableThreadPool$Worker.run(PrioritizableThreadPool.java:269) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread35" #66 daemon prio=6 os_prio=0 tid=0x00002ac814017000 nid=0xd9c5 runnable [0x00002ac7aedc8000] java.lang.Thread.State: RUNNABLE at java.lang.UNIXProcess.forkAndExec(Native Method) at java.lang.UNIXProcess.(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.(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) "process reaper" #50 daemon prio=10 os_prio=0 tid=0x00002ac83c00b000 nid=0xd9b4 waiting on condition [0x00002ac7a7fc0000] java.lang.Thread.State: TIMED_WAITING (parking) at sun.misc.Unsafe.park(Native Method) - parking to wait for <0x00000004401c4a48> (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" #46 daemon prio=10 os_prio=0 tid=0x00002ac838003800 nid=0xd9af waiting on condition [0x00002ac78ffe2000] java.lang.Thread.State: TIMED_WAITING (parking) at sun.misc.Unsafe.park(Native Method) - parking to wait for <0x00000004401c4a48> (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) "ThreadPoolThread19" #36 daemon prio=6 os_prio=0 tid=0x00002ac814013800 nid=0xd9a1 runnable [0x00002ac7af3ce000] java.lang.Thread.State: RUNNABLE at java.util.HashMap.putVal(HashMap.java:630) at java.util.HashMap.put(HashMap.java:611) at aprove.Framework.Algebra.Polynomials.VarPolynomial.times(VarPolynomial.java:614) at aprove.Framework.Algebra.Polynomials.VarPolynomial.substituteVariables(VarPolynomial.java:838) at aprove.DPFramework.Orders.Utility.POLO.Interpretation.interpretTerm(Interpretation.java:1408) at aprove.DPFramework.Orders.POLO.solves(POLO.java:91) at aprove.DPFramework.Orders.Solvers.KBOPOLOSolver.solve(KBOPOLOSolver.java:295) at aprove.DPFramework.TRSProblem.Solvers.KBOPOLOGenericSolver.solveRRR(KBOPOLOGenericSolver.java:43) at aprove.DPFramework.TRSProblem.Processors.QTRSRRRProcessor.processQTRS(QTRSRRRProcessor.java:63) 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) "process reaper" #30 daemon prio=10 os_prio=0 tid=0x00002ac824002800 nid=0xd99a waiting on condition [0x00002ac78ffa9000] java.lang.Thread.State: TIMED_WAITING (parking) at sun.misc.Unsafe.park(Native Method) - parking to wait for <0x00000004401c4a48> (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) "ThreadPoolThread16" #28 daemon prio=6 os_prio=0 tid=0x00002ac814018800 nid=0xd996 runnable [0x00002ac7af1cc000] java.lang.Thread.State: RUNNABLE at immutables.Immutable.DefaultImmutableMap.entrySet(Unknown Source) at aprove.Framework.Algebra.Polynomials.SimplePolynomial.times(SimplePolynomial.java:475) at aprove.Framework.Algebra.Polynomials.VarPolynomial.times(VarPolynomial.java:606) at aprove.Framework.Algebra.Polynomials.VarPolynomial.substituteVariables(VarPolynomial.java:851) at aprove.DPFramework.Orders.Utility.POLO.Interpretation.interpretTerm(Interpretation.java:1408) at aprove.DPFramework.Orders.Utility.POLO.Interpretation.interpretTerm(Interpretation.java:1401) at aprove.DPFramework.Orders.Utility.POLO.Interpretation.interpretTerm(Interpretation.java:1401) at aprove.DPFramework.Orders.POLO.solves(POLO.java:91) at aprove.DPFramework.Orders.Solvers.KBOPOLOSolver.solve(KBOPOLOSolver.java:289) at aprove.DPFramework.TRSProblem.Solvers.KBOPOLOGenericSolver.solveRRR(KBOPOLOGenericSolver.java:43) at aprove.DPFramework.TRSProblem.Processors.QTRSRRRProcessor.processQTRS(QTRSRRRProcessor.java:63) 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) "ThreadPoolThread11" #23 daemon prio=6 os_prio=0 tid=0x00002ac81400f800 nid=0xd991 runnable [0x00002ac7aeac7000] java.lang.Thread.State: RUNNABLE at immutables.Immutable.ImmutableIterator.hasNext(Unknown Source) at aprove.DPFramework.BasicStructures.TRSFunctionApplication.checkValidConstructorArgs(TRSFunctionApplication.java:228) at aprove.DPFramework.BasicStructures.TRSFunctionApplication.(TRSFunctionApplication.java:264) at aprove.DPFramework.BasicStructures.TRSCompoundTerm.(TRSCompoundTerm.java:22) at aprove.DPFramework.BasicStructures.TRSCompoundTerm.renumberVariables(TRSCompoundTerm.java:88) at aprove.DPFramework.BasicStructures.TRSCompoundTerm.renumberVariables(TRSCompoundTerm.java:82) at aprove.DPFramework.BasicStructures.GeneralizedRule.(GeneralizedRule.java:108) at aprove.DPFramework.BasicStructures.Rule.(Rule.java:53) at aprove.DPFramework.BasicStructures.Rule.create(Rule.java:74) at aprove.DPFramework.BasicStructures.Matchbounds.EnrichmentBuilder.createER(EnrichmentBuilder.java:166) 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) "ThreadPoolThread8" #20 daemon prio=6 os_prio=0 tid=0x00002ac81400b800 nid=0xd98e runnable [0x00002ac7addbb000] java.lang.Thread.State: RUNNABLE at java.util.HashSet.add(HashSet.java:219) at aprove.DPFramework.BasicStructures.Matchbounds.TRSBoundsTA.solveStateSubstitutions(TRSBoundsTA.java:325) 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) "TimeRefresherThread" #19 daemon prio=6 os_prio=0 tid=0x00002ac81400b000 nid=0xd98d runnable [0x00002ac7adcbb000] java.lang.Thread.State: RUNNABLE at sun.management.ThreadImpl.getThreadTotalCpuTime0(Native Method) at sun.management.ThreadImpl.getThreadCpuTime(ThreadImpl.java:267) at sun.management.ThreadImpl.getThreadCpuTime(ThreadImpl.java:226) at aprove.Strategies.Abortions.TrackThread.getCpuIncrease(TrackThread.java:129) at aprove.Strategies.Abortions.TrackThread.getTimeIncrease(TrackThread.java:121) - locked <0x000000044046ff18> (a aprove.Strategies.Abortions.TrackThreadPool) at aprove.Strategies.Abortions.TrackThread.checkTime(TrackThread.java:113) at aprove.Strategies.Abortions.TimeRefresher$TimeRefresherThread.doPoll(TimeRefresher.java:65) at aprove.Strategies.Abortions.TimeRefresher$TimeRefresherThread.run(TimeRefresher.java:54) "DefaultMachine" #18 daemon prio=6 os_prio=0 tid=0x00002ac790832800 nid=0xd98c runnable [0x00002ac7adbb9000] java.lang.Thread.State: RUNNABLE at aprove.ProofTree.Obligations.ObligationNode.isTruthValueKnown(ObligationNode.java:104) at aprove.Strategies.ExecutableStrategies.ExecSolve.exec(ExecSolve.java:66) at aprove.Strategies.ExecutableStrategies.ExecAny.exec(ExecAny.java:62) at aprove.Strategies.ExecutableStrategies.ExecFirst.exec(ExecFirst.java:71) at aprove.Strategies.ExecutableStrategies.ExecRepeat.exec(ExecRepeat.java:47) at aprove.Strategies.ExecutableStrategies.ExecAllParallel.exec(ExecAllParallel.java:29) at aprove.Strategies.ExecutableStrategies.ExecSolve.exec(ExecSolve.java:82) at aprove.Strategies.ExecutableStrategies.ExecAny.exec(ExecAny.java:62) at aprove.Strategies.ExecutableStrategies.ExecSolve.exec(ExecSolve.java:82) at aprove.Strategies.ExecutableStrategies.ExecAny.exec(ExecAny.java:62) at aprove.Strategies.ExecutableStrategies.StrategyRoot.evaluateOnce(StrategyRoot.java:35) at aprove.Strategies.ExecutableStrategies.impl.DefaultMachine$CmdExec.run(DefaultMachine.java:247) at aprove.Strategies.ExecutableStrategies.impl.DefaultMachine.run(DefaultMachine.java:174) at java.lang.Thread.run(Thread.java:748) "ThreadPoolThread2" #12 daemon prio=5 os_prio=0 tid=0x00002ac790274800 nid=0xd986 runnable [0x00002ac7ad9b8000] java.lang.Thread.State: RUNNABLE at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.OverlapClosure.equals(OverlapClosure.java:98) 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: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=0x00002ac790266800 nid=0xd985 runnable [0x00002ac7ad8b6000] java.lang.Thread.State: RUNNABLE at java.util.AbstractList.hashCode(AbstractList.java:540) at immutables.Immutable.ImmutableArrayList.hashCode(Unknown Source) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.StringPattern.newHashCode(StringPattern.java:109) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.StringPattern.(StringPattern.java:39) at aprove.DPFramework.TRSProblem.Utility.SRSNonLoop.DerivationPattern.minimize(DerivationPattern.java:161) 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: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=0x00002ac790199800 nid=0xd982 runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "C1 CompilerThread2" #7 daemon prio=9 os_prio=0 tid=0x00002ac790184000 nid=0xd981 waiting on condition [0x0000000000000000] java.lang.Thread.State: RUNNABLE "C2 CompilerThread1" #6 daemon prio=9 os_prio=0 tid=0x00002ac790182000 nid=0xd980 runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "C2 CompilerThread0" #5 daemon prio=9 os_prio=0 tid=0x00002ac79017f800 nid=0xd97f runnable [0x0000000000000000] java.lang.Thread.State: RUNNABLE "Signal Dispatcher" #4 daemon prio=9 os_prio=0 tid=0x00002ac79017e000 nid=0xd97e waiting on condition [0x0000000000000000] java.lang.Thread.State: RUNNABLE "Finalizer" #3 daemon prio=8 os_prio=0 tid=0x00002ac79014a000 nid=0xd97d in Object.wait() [0x00002ac7acf0d000] java.lang.Thread.State: WAITING (on object monitor) at java.lang.Object.wait(Native Method) - waiting on <0x000000044140a798> (a java.lang.ref.ReferenceQueue$Lock) at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:143) - locked <0x000000044140a798> (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=0x00002ac790145800 nid=0xd97c in Object.wait() [0x00002ac7ace0c000] java.lang.Thread.State: WAITING (on object monitor) at java.lang.Object.wait(Native Method) - waiting on <0x00000004413f9938> (a java.lang.ref.Reference$Lock) at java.lang.Object.wait(Object.java:502) at java.lang.ref.Reference.tryHandlePending(Reference.java:191) - locked <0x00000004413f9938> (a java.lang.ref.Reference$Lock) at java.lang.ref.Reference$ReferenceHandler.run(Reference.java:153) "main" #1 prio=5 os_prio=0 tid=0x00002ac790008800 nid=0xd975 in Object.wait() [0x00002ac78c5fe000] java.lang.Thread.State: WAITING (on object monitor) at java.lang.Object.wait(Native Method) - waiting on <0x0000000440002718> (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 <0x0000000440002718> (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=0x00002ac79013e000 nid=0xd97b runnable "GC task thread#0 (ParallelGC)" os_prio=0 tid=0x00002ac79001e000 nid=0xd977 runnable "GC task thread#1 (ParallelGC)" os_prio=0 tid=0x00002ac79001f800 nid=0xd978 runnable "GC task thread#2 (ParallelGC)" os_prio=0 tid=0x00002ac790021800 nid=0xd979 runnable "GC task thread#3 (ParallelGC)" os_prio=0 tid=0x00002ac790023800 nid=0xd97a runnable "VM Periodic Task Thread" os_prio=0 tid=0x00002ac7901ac000 nid=0xd983 waiting on condition JNI global references: 321 Heap PSYoungGen total 4281856K, used 446010K [0x0000000695580000, 0x00000007c0000000, 0x00000007c0000000) eden space 3670528K, 12% used [0x0000000695580000,0x00000006b090ea20,0x0000000775600000) from space 611328K, 0% used [0x000000079ab00000,0x000000079ab00000,0x00000007c0000000) to space 611328K, 0% used [0x0000000775600000,0x0000000775600000,0x000000079ab00000) ParOldGen total 9786880K, used 45125K [0x0000000440000000, 0x0000000695580000, 0x0000000695580000) object space 9786880K, 0% used [0x0000000440000000,0x0000000442c115c0,0x0000000695580000) Metaspace used 21179K, capacity 21406K, committed 21760K, reserved 1069056K class space used 2434K, 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) QTRSRRRProof [EQUIVALENT, 57 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 2 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 7 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 3 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) UsableRulesProof [EQUIVALENT, 0 ms] (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) QDP (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] (28) YES (29) QDP (30) UsableRulesProof [EQUIVALENT, 0 ms] (31) QDP (32) QDPSizeChangeProof [EQUIVALENT, 0 ms] (33) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: q0(0(x1)) -> 0'(q1(x1)) q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q1(1(x1))) -> q2(0(1'(x1))) 0'(q1(1(x1))) -> q2(0'(1'(x1))) 1'(q1(1(x1))) -> q2(1'(1'(x1))) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q2(0'(x1)) -> 0'(q0(x1)) q0(1'(x1)) -> 1'(q3(x1)) q3(1'(x1)) -> 1'(q3(x1)) q3(b(x1)) -> b(q4(x1)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = x_1 POL(0'(x_1)) = x_1 POL(1(x_1)) = 3 + x_1 POL(1'(x_1)) = x_1 POL(b(x_1)) = x_1 POL(q0(x_1)) = 2 + x_1 POL(q1(x_1)) = x_1 POL(q2(x_1)) = 3 + x_1 POL(q3(x_1)) = 1 + x_1 POL(q4(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: q0(0(x1)) -> 0'(q1(x1)) q2(0'(x1)) -> 0'(q0(x1)) q0(1'(x1)) -> 1'(q3(x1)) q3(b(x1)) -> b(q4(x1)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q1(1(x1))) -> q2(0(1'(x1))) 0'(q1(1(x1))) -> q2(0'(1'(x1))) 1'(q1(1(x1))) -> q2(1'(1'(x1))) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(x1)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = x_1 POL(0'(x_1)) = x_1 POL(1(x_1)) = 1 + x_1 POL(1'(x_1)) = x_1 POL(q1(x_1)) = x_1 POL(q2(x_1)) = x_1 POL(q3(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 0(q1(1(x1))) -> q2(0(1'(x1))) 0'(q1(1(x1))) -> q2(0'(1'(x1))) 1'(q1(1(x1))) -> q2(1'(1'(x1))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(x1)) Q is empty. ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: Q1(0(x1)) -> 0^1(q1(x1)) Q1(0(x1)) -> Q1(x1) Q1(1'(x1)) -> 1'^1(q1(x1)) Q1(1'(x1)) -> Q1(x1) 0^1(q2(0(x1))) -> 0^1(0(x1)) 0'^1(q2(0(x1))) -> 0'^1(0(x1)) 1'^1(q2(0(x1))) -> 1'^1(0(x1)) 0^1(q2(1'(x1))) -> 0^1(1'(x1)) 0'^1(q2(1'(x1))) -> 0'^1(1'(x1)) 1'^1(q2(1'(x1))) -> 1'^1(1'(x1)) Q3(1'(x1)) -> 1'^1(q3(x1)) Q3(1'(x1)) -> Q3(x1) The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (7) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 5 SCCs with 3 less nodes. ---------------------------------------- (8) Complex Obligation (AND) ---------------------------------------- (9) Obligation: Q DP problem: The TRS P consists of the following rules: 1'^1(q2(1'(x1))) -> 1'^1(1'(x1)) 1'^1(q2(0(x1))) -> 1'^1(0(x1)) The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (10) 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. ---------------------------------------- (11) Obligation: Q DP problem: The TRS P consists of the following rules: 1'^1(q2(1'(x1))) -> 1'^1(1'(x1)) 1'^1(q2(0(x1))) -> 1'^1(0(x1)) The TRS R consists of the following rules: 0(q2(0(x1))) -> q2(0(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (12) QDPSizeChangeProof (EQUIVALENT) 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. From the DPs we obtained the following set of size-change graphs: *1'^1(q2(1'(x1))) -> 1'^1(1'(x1)) The graph contains the following edges 1 > 1 *1'^1(q2(0(x1))) -> 1'^1(0(x1)) The graph contains the following edges 1 > 1 ---------------------------------------- (13) YES ---------------------------------------- (14) Obligation: Q DP problem: The TRS P consists of the following rules: Q3(1'(x1)) -> Q3(x1) The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (15) 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. ---------------------------------------- (16) Obligation: Q DP problem: The TRS P consists of the following rules: Q3(1'(x1)) -> Q3(x1) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (17) QDPSizeChangeProof (EQUIVALENT) 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. From the DPs we obtained the following set of size-change graphs: *Q3(1'(x1)) -> Q3(x1) The graph contains the following edges 1 > 1 ---------------------------------------- (18) YES ---------------------------------------- (19) Obligation: Q DP problem: The TRS P consists of the following rules: 0'^1(q2(1'(x1))) -> 0'^1(1'(x1)) 0'^1(q2(0(x1))) -> 0'^1(0(x1)) The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (20) 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. ---------------------------------------- (21) Obligation: Q DP problem: The TRS P consists of the following rules: 0'^1(q2(1'(x1))) -> 0'^1(1'(x1)) 0'^1(q2(0(x1))) -> 0'^1(0(x1)) The TRS R consists of the following rules: 0(q2(0(x1))) -> q2(0(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (22) QDPSizeChangeProof (EQUIVALENT) 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. From the DPs we obtained the following set of size-change graphs: *0'^1(q2(1'(x1))) -> 0'^1(1'(x1)) The graph contains the following edges 1 > 1 *0'^1(q2(0(x1))) -> 0'^1(0(x1)) The graph contains the following edges 1 > 1 ---------------------------------------- (23) YES ---------------------------------------- (24) Obligation: Q DP problem: The TRS P consists of the following rules: 0^1(q2(1'(x1))) -> 0^1(1'(x1)) 0^1(q2(0(x1))) -> 0^1(0(x1)) The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(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: 0^1(q2(1'(x1))) -> 0^1(1'(x1)) 0^1(q2(0(x1))) -> 0^1(0(x1)) The TRS R consists of the following rules: 0(q2(0(x1))) -> q2(0(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (27) QDPSizeChangeProof (EQUIVALENT) 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. From the DPs we obtained the following set of size-change graphs: *0^1(q2(1'(x1))) -> 0^1(1'(x1)) The graph contains the following edges 1 > 1 *0^1(q2(0(x1))) -> 0^1(0(x1)) The graph contains the following edges 1 > 1 ---------------------------------------- (28) YES ---------------------------------------- (29) Obligation: Q DP problem: The TRS P consists of the following rules: Q1(1'(x1)) -> Q1(x1) Q1(0(x1)) -> Q1(x1) The TRS R consists of the following rules: q1(0(x1)) -> 0(q1(x1)) q1(1'(x1)) -> 1'(q1(x1)) 0(q2(0(x1))) -> q2(0(0(x1))) 0'(q2(0(x1))) -> q2(0'(0(x1))) 1'(q2(0(x1))) -> q2(1'(0(x1))) 0(q2(1'(x1))) -> q2(0(1'(x1))) 0'(q2(1'(x1))) -> q2(0'(1'(x1))) 1'(q2(1'(x1))) -> q2(1'(1'(x1))) q3(1'(x1)) -> 1'(q3(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (30) 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. ---------------------------------------- (31) Obligation: Q DP problem: The TRS P consists of the following rules: Q1(1'(x1)) -> Q1(x1) Q1(0(x1)) -> Q1(x1) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (32) QDPSizeChangeProof (EQUIVALENT) 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. From the DPs we obtained the following set of size-change graphs: *Q1(1'(x1)) -> Q1(x1) The graph contains the following edges 1 > 1 *Q1(0(x1)) -> Q1(x1) The graph contains the following edges 1 > 1 ---------------------------------------- (33) YES