/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c --full-output --architecture 32bit --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5eb3fea6 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6812207659d67444abdc9d105ff32acac8458b5 --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false .......................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6812207659d67444abdc9d105ff32acac8458b5 --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:03:11,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:03:11,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:03:11,343 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:03:11,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:03:11,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:03:11,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:03:11,350 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:03:11,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:03:11,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:03:11,357 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:03:11,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:03:11,358 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:03:11,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:03:11,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:03:11,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:03:11,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:03:11,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:03:11,373 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:03:11,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:03:11,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:03:11,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:03:11,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:03:11,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:03:11,394 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:03:11,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:03:11,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:03:11,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:03:11,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:03:11,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:03:11,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:03:11,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:03:11,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:03:11,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:03:11,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:03:11,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:03:11,401 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 18:03:11,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:03:11,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:03:11,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:03:11,418 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:03:11,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:03:11,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:03:11,419 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:03:11,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:03:11,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:03:11,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 18:03:11,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:03:11,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:03:11,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:03:11,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:03:11,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:03:11,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:03:11,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:03:11,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:03:11,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:03:11,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:03:11,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:03:11,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:03:11,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:03:11,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:03:11,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:03:11,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:03:11,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 18:03:11,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:03:11,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 18:03:11,423 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6812207659d67444abdc9d105ff32acac8458b5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:03:11,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:03:11,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:03:11,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:03:11,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:03:11,494 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:03:11,495 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-21 18:03:11,887 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da919bb53/856c0c79323e42e88bab929c3740d35f/FLAGa35c47529 [2018-09-21 18:03:12,150 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:03:12,151 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-21 18:03:12,169 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da919bb53/856c0c79323e42e88bab929c3740d35f/FLAGa35c47529 [2018-09-21 18:03:12,188 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da919bb53/856c0c79323e42e88bab929c3740d35f [2018-09-21 18:03:12,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:03:12,195 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:03:12,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:03:12,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:03:12,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:03:12,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:03:12" (1/1) ... [2018-09-21 18:03:12,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619684cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:12, skipping insertion in model container [2018-09-21 18:03:12,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:03:12" (1/1) ... [2018-09-21 18:03:12,220 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:03:12,553 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:882) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$37(StandardFunctionHandler.java:260) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:160) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1549) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:316) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:513) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1928) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1748) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1725) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:339) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:204) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3980) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2445) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:183) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.preRun(MainDispatcher.java:348) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.Dispatcher.run(Dispatcher.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.doTranslation(CACSL2BoogieTranslatorObserver.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:152) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-21 18:03:12,560 INFO L168 Benchmark]: Toolchain (without parser) took 367.55 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:03:12,562 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:03:12,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:03:12,567 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:882) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:03:14,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:03:14,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:03:14,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:03:14,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:03:14,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:03:14,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:03:14,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:03:14,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:03:14,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:03:14,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:03:14,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:03:14,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:03:14,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:03:14,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:03:14,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:03:14,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:03:14,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:03:14,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:03:14,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:03:14,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:03:14,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:03:14,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:03:14,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:03:14,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:03:14,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:03:14,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:03:14,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:03:14,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:03:14,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:03:14,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:03:14,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:03:14,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:03:14,804 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:03:14,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:03:14,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:03:14,806 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 18:03:14,837 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:03:14,838 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:03:14,839 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:03:14,840 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:03:14,840 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:03:14,840 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:03:14,841 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:03:14,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:03:14,841 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:03:14,841 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:03:14,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:03:14,844 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:03:14,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:03:14,844 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:03:14,844 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 18:03:14,844 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 18:03:14,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:03:14,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:03:14,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:03:14,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:03:14,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:03:14,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:03:14,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:03:14,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:03:14,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:03:14,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:03:14,846 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:03:14,850 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 18:03:14,850 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:03:14,850 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 18:03:14,850 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 18:03:14,850 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6812207659d67444abdc9d105ff32acac8458b5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:03:14,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:03:14,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:03:14,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:03:14,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:03:14,928 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:03:14,929 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-21 18:03:15,323 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2798e4547/a8306f98b3e54d16a0964ca9090b91b4/FLAG4b9c20ce7 [2018-09-21 18:03:15,551 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:03:15,552 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-21 18:03:15,564 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2798e4547/a8306f98b3e54d16a0964ca9090b91b4/FLAG4b9c20ce7 [2018-09-21 18:03:15,582 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2798e4547/a8306f98b3e54d16a0964ca9090b91b4 [2018-09-21 18:03:15,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:03:15,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:03:15,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:03:15,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:03:15,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:03:15,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:03:15" (1/1) ... [2018-09-21 18:03:15,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b61516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:15, skipping insertion in model container [2018-09-21 18:03:15,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:03:15" (1/1) ... [2018-09-21 18:03:15,615 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:03:16,077 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:03:16,102 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:03:16,246 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:03:16,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16 WrapperNode [2018-09-21 18:03:16,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:03:16,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:03:16,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:03:16,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:03:16,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... [2018-09-21 18:03:16,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... [2018-09-21 18:03:16,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... [2018-09-21 18:03:16,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... [2018-09-21 18:03:16,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... [2018-09-21 18:03:16,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... [2018-09-21 18:03:16,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... [2018-09-21 18:03:16,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:03:16,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:03:16,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:03:16,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:03:16,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:03:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:03:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:03:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2018-09-21 18:03:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2018-09-21 18:03:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-21 18:03:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-21 18:03:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_pow [2018-09-21 18:03:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-21 18:03:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:03:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:03:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-21 18:03:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2018-09-21 18:03:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:03:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-21 18:03:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 18:03:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:03:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 18:03:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-21 18:03:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2018-09-21 18:03:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-21 18:03:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-21 18:03:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_pow [2018-09-21 18:03:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-21 18:03:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:03:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:03:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:03:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-21 18:03:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 18:03:17,280 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:17,812 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:17,835 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:18,354 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:18,400 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:19,302 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:20,410 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:20,603 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:20,652 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:20,715 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:20,731 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:20,758 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:20,974 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:23,502 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:23,569 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:26,229 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:28,473 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:30,767 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:31,696 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:33,967 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:33,981 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:33,992 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:34,038 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:34,050 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:36,155 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:43,835 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:43,891 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:43,956 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:43,986 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:44,452 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:47,431 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:47,443 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:03:47,516 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:02,253 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:03,366 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:03,411 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:03,480 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:03,497 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:03,628 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:03,680 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:03,767 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:08,477 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:08,488 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:08,503 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:04:10,580 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:04:10,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:04:10 BoogieIcfgContainer [2018-09-21 18:04:10,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:04:10,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:04:10,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:04:10,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:04:10,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:03:15" (1/3) ... [2018-09-21 18:04:10,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de0a136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:04:10, skipping insertion in model container [2018-09-21 18:04:10,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:03:16" (2/3) ... [2018-09-21 18:04:10,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de0a136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:04:10, skipping insertion in model container [2018-09-21 18:04:10,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:04:10" (3/3) ... [2018-09-21 18:04:10,595 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0882_true-unreach-call.c [2018-09-21 18:04:10,608 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:04:10,618 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:04:10,668 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:04:10,669 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:04:10,669 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:04:10,669 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:04:10,669 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:04:10,670 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:04:10,670 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:04:10,670 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:04:10,670 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:04:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states. [2018-09-21 18:04:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-21 18:04:10,719 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:04:10,720 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:04:10,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:04:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash -83967081, now seen corresponding path program 1 times [2018-09-21 18:04:10,732 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:04:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-21 18:04:10,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:04:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:04:10,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:04:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:04:10,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:04:10,994 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:04:10,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:04:10,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:04:11,012 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:04:11,013 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:04:11,015 INFO L87 Difference]: Start difference. First operand 513 states. Second operand 2 states. [2018-09-21 18:04:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:04:11,077 INFO L93 Difference]: Finished difference Result 513 states and 595 transitions. [2018-09-21 18:04:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:04:11,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-21 18:04:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:04:11,123 INFO L225 Difference]: With dead ends: 513 [2018-09-21 18:04:11,123 INFO L226 Difference]: Without dead ends: 508 [2018-09-21 18:04:11,125 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:04:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-09-21 18:04:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-09-21 18:04:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-21 18:04:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 589 transitions. [2018-09-21 18:04:11,214 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 589 transitions. Word has length 19 [2018-09-21 18:04:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:04:11,215 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 589 transitions. [2018-09-21 18:04:11,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:04:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 589 transitions. [2018-09-21 18:04:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-21 18:04:11,218 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:04:11,218 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:04:11,218 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:04:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1192673683, now seen corresponding path program 1 times [2018-09-21 18:04:11,220 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:04:11,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-21 18:04:11,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:04:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:04:11,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:04:11,693 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:11,702 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:11,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:04:11,722 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:11,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:04:11,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:11,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:11,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:04:11,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:04:12,264 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:12,265 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:12,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:04:12,284 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:12,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:04:12,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:12,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:12,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:04:12,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:04:12,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-21 18:04:12,601 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:12,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-21 18:04:12,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:12,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:12,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:04:12,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:04:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:04:13,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:04:13,177 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:04:13,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:04:13,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:04:13,181 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:04:13,181 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:04:13,181 INFO L87 Difference]: Start difference. First operand 508 states and 589 transitions. Second operand 11 states. [2018-09-21 18:04:13,934 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:04:15,035 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:04:15,862 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:04:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:04:39,966 INFO L93 Difference]: Finished difference Result 517 states and 600 transitions. [2018-09-21 18:04:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:04:39,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-09-21 18:04:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:04:39,975 INFO L225 Difference]: With dead ends: 517 [2018-09-21 18:04:39,976 INFO L226 Difference]: Without dead ends: 515 [2018-09-21 18:04:39,978 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-21 18:04:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-21 18:04:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 508. [2018-09-21 18:04:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-21 18:04:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 588 transitions. [2018-09-21 18:04:40,006 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 588 transitions. Word has length 45 [2018-09-21 18:04:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:04:40,007 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 588 transitions. [2018-09-21 18:04:40,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:04:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 588 transitions. [2018-09-21 18:04:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-21 18:04:40,010 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:04:40,010 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:04:40,010 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:04:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash -444726217, now seen corresponding path program 1 times [2018-09-21 18:04:40,011 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:04:40,012 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-21 18:04:40,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:04:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:04:40,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:04:40,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:04:40,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:04:40,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:40,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:40,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:04:40,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:04:40,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:04:40,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:04:40,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:40,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:40,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:04:40,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:04:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:04:40,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:04:40,785 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:04:40,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:04:40,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:04:40,785 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:04:40,786 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:04:40,787 INFO L87 Difference]: Start difference. First operand 508 states and 588 transitions. Second operand 9 states. [2018-09-21 18:04:41,155 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-21 18:04:41,669 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:05:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:05:02,126 INFO L93 Difference]: Finished difference Result 610 states and 700 transitions. [2018-09-21 18:05:02,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:05:02,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-09-21 18:05:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:05:02,132 INFO L225 Difference]: With dead ends: 610 [2018-09-21 18:05:02,133 INFO L226 Difference]: Without dead ends: 607 [2018-09-21 18:05:02,133 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:05:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-09-21 18:05:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 508. [2018-09-21 18:05:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-21 18:05:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 585 transitions. [2018-09-21 18:05:02,175 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 585 transitions. Word has length 47 [2018-09-21 18:05:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:05:02,175 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 585 transitions. [2018-09-21 18:05:02,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:05:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 585 transitions. [2018-09-21 18:05:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-21 18:05:02,178 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:05:02,179 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:05:02,179 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:05:02,179 INFO L82 PathProgramCache]: Analyzing trace with hash 442777464, now seen corresponding path program 1 times [2018-09-21 18:05:02,180 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:05:02,180 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-21 18:05:02,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:05:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:05:02,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:05:02,712 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:02,713 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:02,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:05:02,738 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:02,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:05:02,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:02,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:03,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:03,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-09-21 18:05:03,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:03,975 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:03,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:05:04,028 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:04,145 INFO L303 Elim1Store]: Index analysis took 165 ms [2018-09-21 18:05:04,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:05:04,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:04,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:04,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:04,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2018-09-21 18:05:04,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-21 18:05:04,710 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:04,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-21 18:05:04,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:04,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:04,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:04,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-09-21 18:05:05,236 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:05,250 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:05,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:05:05,264 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:05,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:05:05,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:05,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:05,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:05,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-09-21 18:05:05,972 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:05,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:05,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:05:05,987 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:06,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:05:06,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:06,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:06,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:06,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-09-21 18:05:06,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-21 18:05:06,333 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:06,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-21 18:05:06,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:06,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:06,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:06,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:35 [2018-09-21 18:05:07,439 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2018-09-21 18:05:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:05:07,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:05:07,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:05:07,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:05:07,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:05:07,504 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:05:07,504 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:05:07,504 INFO L87 Difference]: Start difference. First operand 508 states and 585 transitions. Second operand 17 states. [2018-09-21 18:05:09,976 WARN L178 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:05:11,268 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:05:11,953 WARN L178 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:05:12,411 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-21 18:05:12,909 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-21 18:05:13,622 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:05:14,029 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-21 18:05:14,598 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:05:15,038 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-09-21 18:05:15,844 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:05:16,199 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:05:16,758 WARN L178 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:05:18,547 WARN L178 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-09-21 18:06:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:26,596 INFO L93 Difference]: Finished difference Result 614 states and 703 transitions. [2018-09-21 18:06:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-21 18:06:26,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-09-21 18:06:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:26,603 INFO L225 Difference]: With dead ends: 614 [2018-09-21 18:06:26,604 INFO L226 Difference]: Without dead ends: 611 [2018-09-21 18:06:26,604 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2018-09-21 18:06:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-09-21 18:06:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 507. [2018-09-21 18:06:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-09-21 18:06:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 583 transitions. [2018-09-21 18:06:26,620 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 583 transitions. Word has length 47 [2018-09-21 18:06:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:26,621 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 583 transitions. [2018-09-21 18:06:26,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:06:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 583 transitions. [2018-09-21 18:06:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-21 18:06:26,623 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:26,623 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:06:26,623 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash 801540408, now seen corresponding path program 1 times [2018-09-21 18:06:26,625 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:26,625 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-21 18:06:26,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:27,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:30,222 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 |c___ieee754_pow_#in~x|))) is different from false [2018-09-21 18:06:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:06:30,278 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:30,297 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:30,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:06:30,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:06:30,298 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:06:30,298 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-21 18:06:30,298 INFO L87 Difference]: Start difference. First operand 507 states and 583 transitions. Second operand 8 states. [2018-09-21 18:06:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:53,580 INFO L93 Difference]: Finished difference Result 599 states and 683 transitions. [2018-09-21 18:06:53,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-21 18:06:53,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-09-21 18:06:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:53,587 INFO L225 Difference]: With dead ends: 599 [2018-09-21 18:06:53,588 INFO L226 Difference]: Without dead ends: 599 [2018-09-21 18:06:53,588 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2018-09-21 18:06:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-21 18:06:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 511. [2018-09-21 18:06:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-09-21 18:06:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 587 transitions. [2018-09-21 18:06:53,605 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 587 transitions. Word has length 51 [2018-09-21 18:06:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:53,605 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 587 transitions. [2018-09-21 18:06:53,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:06:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 587 transitions. [2018-09-21 18:06:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-21 18:06:53,613 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:53,613 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:06:53,614 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1689044089, now seen corresponding path program 1 times [2018-09-21 18:06:53,615 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:53,617 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-21 18:06:53,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:53,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:53,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:06:53,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:06:53,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:53,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:53,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:06:53,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:06:53,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:06:53,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:06:53,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:53,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:53,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:06:53,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:06:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:06:54,532 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:54,544 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:54,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:06:54,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:06:54,546 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:06:54,546 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:06:54,546 INFO L87 Difference]: Start difference. First operand 511 states and 587 transitions. Second operand 10 states. [2018-09-21 18:06:55,031 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:06:55,776 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-21 18:06:58,671 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-09-21 18:07:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:15,995 INFO L93 Difference]: Finished difference Result 515 states and 590 transitions. [2018-09-21 18:07:15,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:07:15,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-09-21 18:07:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:15,999 INFO L225 Difference]: With dead ends: 515 [2018-09-21 18:07:16,002 INFO L226 Difference]: Without dead ends: 513 [2018-09-21 18:07:16,002 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:07:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-21 18:07:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 511. [2018-09-21 18:07:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-09-21 18:07:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 586 transitions. [2018-09-21 18:07:16,019 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 586 transitions. Word has length 51 [2018-09-21 18:07:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:16,019 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 586 transitions. [2018-09-21 18:07:16,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:07:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 586 transitions. [2018-09-21 18:07:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-21 18:07:16,028 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:16,029 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:07:16,029 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1068208600, now seen corresponding path program 1 times [2018-09-21 18:07:16,030 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:16,030 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:07:16,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-21 18:07:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:16,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:16,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:07:16,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:07:16,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:16,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:16,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:16,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:16,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:07:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:07:16,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:16,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:16,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:16,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:07:16,914 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:16,929 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:16,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:07:16,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:07:16,931 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:07:16,931 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:07:16,931 INFO L87 Difference]: Start difference. First operand 511 states and 586 transitions. Second operand 8 states. [2018-09-21 18:07:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:35,011 INFO L93 Difference]: Finished difference Result 519 states and 595 transitions. [2018-09-21 18:07:35,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:07:35,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-09-21 18:07:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:35,016 INFO L225 Difference]: With dead ends: 519 [2018-09-21 18:07:35,016 INFO L226 Difference]: Without dead ends: 517 [2018-09-21 18:07:35,017 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:07:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-09-21 18:07:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 511. [2018-09-21 18:07:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-09-21 18:07:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 585 transitions. [2018-09-21 18:07:35,032 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 585 transitions. Word has length 51 [2018-09-21 18:07:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:35,032 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 585 transitions. [2018-09-21 18:07:35,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:07:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 585 transitions. [2018-09-21 18:07:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-21 18:07:35,035 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:35,035 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:07:35,035 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash -920553107, now seen corresponding path program 1 times [2018-09-21 18:07:35,037 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:35,038 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-21 18:07:35,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:07:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:35,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:35,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:07:35,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:07:35,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:35,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:35,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:07:35,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:07:35,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:35,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:07:35,813 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:35,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:35,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:07:35,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:07:35,828 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:07:35,828 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:07:35,829 INFO L87 Difference]: Start difference. First operand 511 states and 585 transitions. Second operand 9 states. [2018-09-21 18:07:36,174 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-21 18:07:36,550 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:07:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:54,312 INFO L93 Difference]: Finished difference Result 790 states and 887 transitions. [2018-09-21 18:07:54,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:07:54,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-09-21 18:07:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:54,319 INFO L225 Difference]: With dead ends: 790 [2018-09-21 18:07:54,319 INFO L226 Difference]: Without dead ends: 595 [2018-09-21 18:07:54,320 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:07:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-09-21 18:07:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 497. [2018-09-21 18:07:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-09-21 18:07:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 564 transitions. [2018-09-21 18:07:54,335 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 564 transitions. Word has length 53 [2018-09-21 18:07:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:54,336 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 564 transitions. [2018-09-21 18:07:54,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:07:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 564 transitions. [2018-09-21 18:07:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-21 18:07:54,337 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:54,337 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:07:54,344 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1086505061, now seen corresponding path program 1 times [2018-09-21 18:07:54,344 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:54,344 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:07:54,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-21 18:07:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:54,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:54,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:07:54,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:07:54,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:54,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:54,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:54,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:54,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:07:54,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:07:54,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:54,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:54,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:54,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:07:54,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:54,928 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:54,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:07:54,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:07:54,929 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:07:54,929 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:07:54,929 INFO L87 Difference]: Start difference. First operand 497 states and 564 transitions. Second operand 8 states. [2018-09-21 18:08:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:17,151 INFO L93 Difference]: Finished difference Result 635 states and 717 transitions. [2018-09-21 18:08:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:08:17,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-09-21 18:08:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:17,156 INFO L225 Difference]: With dead ends: 635 [2018-09-21 18:08:17,156 INFO L226 Difference]: Without dead ends: 554 [2018-09-21 18:08:17,157 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:08:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-09-21 18:08:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 436. [2018-09-21 18:08:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-09-21 18:08:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 483 transitions. [2018-09-21 18:08:17,175 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 483 transitions. Word has length 53 [2018-09-21 18:08:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:17,176 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 483 transitions. [2018-09-21 18:08:17,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:08:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 483 transitions. [2018-09-21 18:08:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-21 18:08:17,177 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:17,178 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:08:17,178 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash 277158435, now seen corresponding path program 1 times [2018-09-21 18:08:17,179 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:17,179 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-21 18:08:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:08:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:17,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:08:17,549 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:17,563 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:17,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 18:08:17,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 18:08:17,564 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 18:08:17,564 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-21 18:08:17,564 INFO L87 Difference]: Start difference. First operand 436 states and 483 transitions. Second operand 7 states. [2018-09-21 18:08:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:39,876 INFO L93 Difference]: Finished difference Result 442 states and 489 transitions. [2018-09-21 18:08:39,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:08:39,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-09-21 18:08:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:39,880 INFO L225 Difference]: With dead ends: 442 [2018-09-21 18:08:39,881 INFO L226 Difference]: Without dead ends: 442 [2018-09-21 18:08:39,881 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:08:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-09-21 18:08:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2018-09-21 18:08:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-09-21 18:08:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 483 transitions. [2018-09-21 18:08:39,892 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 483 transitions. Word has length 53 [2018-09-21 18:08:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:39,894 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 483 transitions. [2018-09-21 18:08:39,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:08:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 483 transitions. [2018-09-21 18:08:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-21 18:08:39,896 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:39,896 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:08:39,897 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash 63571582, now seen corresponding path program 1 times [2018-09-21 18:08:39,897 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:39,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-21 18:08:39,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:08:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:40,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:43,524 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 |c___ieee754_pow_#in~x|))) is different from false [2018-09-21 18:08:43,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:08:43,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:08:43,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:43,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:43,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:08:43,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:08:43,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:08:43,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:08:43,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:43,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:43,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:08:43,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:08:44,380 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:08:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:08:44,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:44,590 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:44,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-21 18:08:44,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-21 18:08:44,591 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-21 18:08:44,591 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2018-09-21 18:08:44,592 INFO L87 Difference]: Start difference. First operand 436 states and 483 transitions. Second operand 15 states. [2018-09-21 18:08:56,539 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:08:57,350 WARN L178 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-21 18:09:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:09:17,804 INFO L93 Difference]: Finished difference Result 526 states and 581 transitions. [2018-09-21 18:09:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:09:17,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-09-21 18:09:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:09:17,809 INFO L225 Difference]: With dead ends: 526 [2018-09-21 18:09:17,809 INFO L226 Difference]: Without dead ends: 504 [2018-09-21 18:09:17,810 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=148, Invalid=725, Unknown=1, NotChecked=56, Total=930 [2018-09-21 18:09:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-09-21 18:09:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 435. [2018-09-21 18:09:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-09-21 18:09:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 481 transitions. [2018-09-21 18:09:17,821 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 481 transitions. Word has length 67 [2018-09-21 18:09:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:09:17,822 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 481 transitions. [2018-09-21 18:09:17,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-21 18:09:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 481 transitions. [2018-09-21 18:09:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-21 18:09:17,823 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:09:17,823 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:09:17,823 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:09:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1096245609, now seen corresponding path program 1 times [2018-09-21 18:09:17,826 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:09:17,826 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-21 18:09:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:09:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:09:18,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:09:18,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:09:18,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:09:18,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:09:18,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:09:18,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:09:18,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:09:18,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:09:18,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:09:18,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:09:18,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:09:18,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:09:18,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:09:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:09:18,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:09:18,827 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:09:18,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-21 18:09:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-21 18:09:18,828 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-21 18:09:18,828 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:09:18,829 INFO L87 Difference]: Start difference. First operand 435 states and 481 transitions. Second operand 14 states. [2018-09-21 18:09:26,454 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:09:26,705 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:09:27,037 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:09:27,454 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:09:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:09:42,561 INFO L93 Difference]: Finished difference Result 438 states and 484 transitions. [2018-09-21 18:09:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-21 18:09:42,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-09-21 18:09:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:09:42,565 INFO L225 Difference]: With dead ends: 438 [2018-09-21 18:09:42,565 INFO L226 Difference]: Without dead ends: 427 [2018-09-21 18:09:42,566 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-09-21 18:09:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-09-21 18:09:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-09-21 18:09:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-21 18:09:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 472 transitions. [2018-09-21 18:09:42,578 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 472 transitions. Word has length 69 [2018-09-21 18:09:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:09:42,578 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 472 transitions. [2018-09-21 18:09:42,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-21 18:09:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 472 transitions. [2018-09-21 18:09:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-21 18:09:42,581 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:09:42,581 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:09:42,582 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:09:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1774528776, now seen corresponding path program 1 times [2018-09-21 18:09:42,584 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:09:42,584 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:09:42,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:09:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:09:43,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:09:43,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:09:43,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:09:43,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:09:43,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:09:43,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:09:43,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:09:43,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:09:43,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:09:43,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:09:43,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:09:43,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:09:43,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:09:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:09:44,397 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:09:44,421 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:09:44,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:09:44,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:09:44,422 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:09:44,422 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:09:44,422 INFO L87 Difference]: Start difference. First operand 427 states and 472 transitions. Second operand 10 states. [2018-09-21 18:09:46,578 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-21 18:09:46,904 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:09:47,651 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:09:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:09:58,231 INFO L93 Difference]: Finished difference Result 527 states and 581 transitions. [2018-09-21 18:09:58,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:09:58,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-09-21 18:09:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:09:58,234 INFO L225 Difference]: With dead ends: 527 [2018-09-21 18:09:58,234 INFO L226 Difference]: Without dead ends: 343 [2018-09-21 18:09:58,235 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:09:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-21 18:09:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 330. [2018-09-21 18:09:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-21 18:09:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 364 transitions. [2018-09-21 18:09:58,244 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 364 transitions. Word has length 78 [2018-09-21 18:09:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:09:58,244 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 364 transitions. [2018-09-21 18:09:58,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:09:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 364 transitions. [2018-09-21 18:09:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-21 18:09:58,247 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:09:58,247 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:09:58,249 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:09:58,249 INFO L82 PathProgramCache]: Analyzing trace with hash 481652512, now seen corresponding path program 1 times [2018-09-21 18:09:58,249 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:09:58,250 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-21 18:09:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:09:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:09:59,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:09:59,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:09:59,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:09:59,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:09:59,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:09:59,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:09:59,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-21 18:10:00,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:10:00,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:10:00,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:10:00,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-21 18:10:00,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:10:00,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:10:00,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:10:00,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-21 18:10:00,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:10:00,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:10:00,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:10:00,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-21 18:10:00,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-09-21 18:10:00,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-09-21 18:10:00,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:10:00,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:10:00,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-09-21 18:10:01,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-09-21 18:10:01,148 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:10:01,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-09-21 18:10:01,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:10:01,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:10:01,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:10:01,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-09-21 18:10:01,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-09-21 18:10:01,674 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:10:01,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2018-09-21 18:10:01,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:10:01,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:10:01,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:10:01,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:89, output treesize:51 [2018-09-21 18:10:05,826 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_61| (_ BitVec 64)) (|v_q#valueAsBitvector_60| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_61|) ((_ extract 62 52) |v_q#valueAsBitvector_61|) ((_ extract 51 0) |v_q#valueAsBitvector_61|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_60|) ((_ extract 62 52) |v_q#valueAsBitvector_60|) ((_ extract 51 0) |v_q#valueAsBitvector_60|)) |c___ieee754_pow_#in~x|) (= c___ieee754_pow_~z~1 (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_60|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_61|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))))) (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-21 18:10:08,278 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_61| (_ BitVec 64)) (|v_q#valueAsBitvector_60| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_61|) ((_ extract 62 52) |v_q#valueAsBitvector_61|) ((_ extract 51 0) |v_q#valueAsBitvector_61|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_60|) ((_ extract 62 52) |v_q#valueAsBitvector_60|) ((_ extract 51 0) |v_q#valueAsBitvector_60|)) |c___ieee754_pow_#in~x|) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_60|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_61|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))))) (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-21 18:10:11,891 WARN L819 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_61| (_ BitVec 64)) (|v_q#valueAsBitvector_60| (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (_ +zero 11 53)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_61|) ((_ extract 62 52) |v_q#valueAsBitvector_61|) ((_ extract 51 0) |v_q#valueAsBitvector_61|)) .cse0) (= |c_main_#t~ret80| (fp.div RNE .cse1 (let ((.cse2 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_60|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_61|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_60|) ((_ extract 62 52) |v_q#valueAsBitvector_60|) ((_ extract 51 0) |v_q#valueAsBitvector_60|))))))) is different from true [2018-09-21 18:10:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:10:14,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:10:14,905 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:10:14,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-21 18:10:14,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-21 18:10:14,906 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-21 18:10:14,906 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=325, Unknown=3, NotChecked=114, Total=506 [2018-09-21 18:10:14,909 INFO L87 Difference]: Start difference. First operand 330 states and 364 transitions. Second operand 23 states. [2018-09-21 18:10:45,537 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-21 18:10:45,992 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-09-21 18:10:46,620 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-09-21 18:10:47,082 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-09-21 18:10:49,016 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:10:54,803 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_61| (_ BitVec 64)) (|v_q#valueAsBitvector_60| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_61|) ((_ extract 62 52) |v_q#valueAsBitvector_61|) ((_ extract 51 0) |v_q#valueAsBitvector_61|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_60|) ((_ extract 62 52) |v_q#valueAsBitvector_60|) ((_ extract 51 0) |v_q#valueAsBitvector_60|)) |c___ieee754_pow_#in~x|) (= c___ieee754_pow_~z~1 (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_60|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_61|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))))) (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= c___ieee754_pow_~x |c___ieee754_pow_#in~x|) (exists ((|v_q#valueAsBitvector_61| (_ BitVec 64)) (|v_q#valueAsBitvector_60| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_61|) ((_ extract 62 52) |v_q#valueAsBitvector_61|) ((_ extract 51 0) |v_q#valueAsBitvector_61|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_60|) ((_ extract 62 52) |v_q#valueAsBitvector_60|) ((_ extract 51 0) |v_q#valueAsBitvector_60|)) |c___ieee754_pow_#in~x|) (= (let ((.cse1 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_60|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_61|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) c___ieee754_pow_~ax~0)))) is different from false [2018-09-21 18:11:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:11:18,418 INFO L93 Difference]: Finished difference Result 354 states and 387 transitions. [2018-09-21 18:11:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-21 18:11:18,420 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-09-21 18:11:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:11:18,421 INFO L225 Difference]: With dead ends: 354 [2018-09-21 18:11:18,422 INFO L226 Difference]: Without dead ends: 354 [2018-09-21 18:11:18,422 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=157, Invalid=977, Unknown=4, NotChecked=268, Total=1406 [2018-09-21 18:11:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-09-21 18:11:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 335. [2018-09-21 18:11:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-21 18:11:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 369 transitions. [2018-09-21 18:11:18,436 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 369 transitions. Word has length 81 [2018-09-21 18:11:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:11:18,437 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 369 transitions. [2018-09-21 18:11:18,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-21 18:11:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 369 transitions. [2018-09-21 18:11:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-21 18:11:18,439 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:11:18,440 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:11:18,440 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:11:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 87698346, now seen corresponding path program 1 times [2018-09-21 18:11:18,441 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:11:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-21 18:11:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:11:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:11:19,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:11:19,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:11:19,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:11:19,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:11:19,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:11:19,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:19,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:11:19,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:11:19,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:11:19,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:11:19,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:11:19,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:19,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:11:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:11:19,913 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:11:19,938 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:11:19,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:11:19,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:11:19,939 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:11:19,939 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:11:19,940 INFO L87 Difference]: Start difference. First operand 335 states and 369 transitions. Second operand 8 states. [2018-09-21 18:11:21,554 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:11:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:11:24,630 INFO L93 Difference]: Finished difference Result 466 states and 516 transitions. [2018-09-21 18:11:24,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:11:24,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-09-21 18:11:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:11:24,633 INFO L225 Difference]: With dead ends: 466 [2018-09-21 18:11:24,633 INFO L226 Difference]: Without dead ends: 325 [2018-09-21 18:11:24,634 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:11:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-21 18:11:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-09-21 18:11:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-21 18:11:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 348 transitions. [2018-09-21 18:11:24,645 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 348 transitions. Word has length 83 [2018-09-21 18:11:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:11:24,645 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 348 transitions. [2018-09-21 18:11:24,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:11:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 348 transitions. [2018-09-21 18:11:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-21 18:11:24,646 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:11:24,648 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:11:24,649 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:11:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1648368742, now seen corresponding path program 1 times [2018-09-21 18:11:24,652 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:11:24,652 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-21 18:11:24,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:11:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:11:25,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:11:25,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-09-21 18:11:25,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-21 18:11:25,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:11:25,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:11:25,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:25,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-09-21 18:11:25,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-09-21 18:11:25,998 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:11:26,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-09-21 18:11:26,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:26,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:26,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:26,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2018-09-21 18:11:28,840 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (exists ((v_arrayElimCell_37 (_ BitVec 32)) (fabs_double_~high~0 (_ BitVec 32))) (= (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand fabs_double_~high~0 (_ bv2147483647 32)) v_arrayElimCell_37))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) c___ieee754_pow_~z~1))) is different from false [2018-09-21 18:11:31,285 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (exists ((v_arrayElimCell_37 (_ BitVec 32)) (fabs_double_~high~0 (_ BitVec 32))) (= (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand fabs_double_~high~0 (_ bv2147483647 32)) v_arrayElimCell_37))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) |c___ieee754_pow_#res|))) is different from false [2018-09-21 18:11:33,721 WARN L797 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_37 (_ BitVec 32)) (fabs_double_~high~0 (_ BitVec 32))) (= (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (let ((.cse0 (concat (bvand fabs_double_~high~0 (_ bv2147483647 32)) v_arrayElimCell_37))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) |c_main_#t~ret80|)) is different from false [2018-09-21 18:11:36,151 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_arrayElimCell_37 (_ BitVec 32)) (fabs_double_~high~0 (_ BitVec 32))) (= (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (let ((.cse2 (concat (bvand fabs_double_~high~0 (_ bv2147483647 32)) v_arrayElimCell_37))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) c_main_~res~0))) (.cse0 (fp.eq c_main_~res~0 (_ +zero 11 53)))) (or (and .cse0 .cse1 |c_main_#t~short82|) (and .cse1 (not |c_main_#t~short82|) (not .cse0)))) is different from false [2018-09-21 18:11:38,601 WARN L797 $PredicateComparison]: unable to prove that (and (fp.eq c_main_~res~0 (_ +zero 11 53)) (exists ((v_arrayElimCell_37 (_ BitVec 32)) (fabs_double_~high~0 (_ BitVec 32))) (= (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (let ((.cse0 (concat (bvand fabs_double_~high~0 (_ bv2147483647 32)) v_arrayElimCell_37))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) c_main_~res~0))) is different from false [2018-09-21 18:11:42,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:11:42,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:11:42,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:11:42,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:11:42,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:42,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:11:42,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:11:42,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:11:42,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:11:42,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:11:42,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:11:42,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:11:51,412 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_37 (_ BitVec 32)) (v_prenex_14 (_ BitVec 64)) (fabs_double_~high~0 (_ BitVec 32))) (let ((.cse0 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (let ((.cse1 (concat (bvand fabs_double_~high~0 (_ bv2147483647 32)) v_arrayElimCell_37))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (and (fp.eq .cse0 (_ +zero 11 53)) (= (_ bv0 32) (bvand ((_ extract 63 32) v_prenex_14) (_ bv2147483648 32))) (= .cse0 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))))) (= |c_main_#t~ret81| (_ bv0 32))) is different from false [2018-09-21 18:11:58,716 WARN L797 $PredicateComparison]: unable to prove that (and |c_main_#t~short82| (exists ((v_arrayElimCell_37 (_ BitVec 32)) (v_prenex_14 (_ BitVec 64)) (fabs_double_~high~0 (_ BitVec 32))) (let ((.cse0 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (let ((.cse1 (concat (bvand fabs_double_~high~0 (_ bv2147483647 32)) v_arrayElimCell_37))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (and (fp.eq .cse0 (_ +zero 11 53)) (= (_ bv0 32) (bvand ((_ extract 63 32) v_prenex_14) (_ bv2147483648 32))) (= .cse0 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))))))) is different from false [2018-09-21 18:11:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:11:58,749 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:11:58,774 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:11:58,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:11:58,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:11:58,775 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:11:58,775 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=183, Unknown=7, NotChecked=224, Total=462 [2018-09-21 18:11:58,776 INFO L87 Difference]: Start difference. First operand 325 states and 348 transitions. Second operand 22 states. [2018-09-21 18:12:20,918 WARN L178 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:12:21,159 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:12:21,983 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:12:22,470 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:12:28,358 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:12:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:12:28,706 INFO L93 Difference]: Finished difference Result 342 states and 364 transitions. [2018-09-21 18:12:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-21 18:12:28,707 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-09-21 18:12:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:12:28,709 INFO L225 Difference]: With dead ends: 342 [2018-09-21 18:12:28,710 INFO L226 Difference]: Without dead ends: 318 [2018-09-21 18:12:28,711 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=180, Invalid=897, Unknown=7, NotChecked=476, Total=1560 [2018-09-21 18:12:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-21 18:12:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-21 18:12:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-21 18:12:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 340 transitions. [2018-09-21 18:12:28,716 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 340 transitions. Word has length 97 [2018-09-21 18:12:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:12:28,718 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 340 transitions. [2018-09-21 18:12:28,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:12:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 340 transitions. [2018-09-21 18:12:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-21 18:12:28,721 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:28,721 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:12:28,721 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1765019832, now seen corresponding path program 1 times [2018-09-21 18:12:28,723 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:12:28,723 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-21 18:12:28,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:12:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:12:32,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:12:32,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-21 18:12:32,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:12:32,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:12:32,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:12:32,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:12:32,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:12:32,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-21 18:12:32,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-21 18:12:32,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:12:32,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:12:32,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:12:32,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:12:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:12:33,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:12:33,268 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:12:33,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:12:33,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:12:33,269 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:12:33,270 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:12:33,270 INFO L87 Difference]: Start difference. First operand 318 states and 340 transitions. Second operand 10 states. [2018-09-21 18:12:34,970 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-09-21 18:12:35,415 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:12:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:12:39,378 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2018-09-21 18:12:39,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:12:39,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2018-09-21 18:12:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:12:39,381 INFO L225 Difference]: With dead ends: 297 [2018-09-21 18:12:39,381 INFO L226 Difference]: Without dead ends: 0 [2018-09-21 18:12:39,382 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:12:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-21 18:12:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-21 18:12:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-21 18:12:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-21 18:12:39,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2018-09-21 18:12:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:12:39,383 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-21 18:12:39,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:12:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-21 18:12:39,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-21 18:12:39,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:12:39 BoogieIcfgContainer [2018-09-21 18:12:39,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:12:39,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:12:39,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:12:39,390 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:12:39,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:04:10" (3/4) ... [2018-09-21 18:12:39,398 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-21 18:12:39,406 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrt [2018-09-21 18:12:39,407 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2018-09-21 18:12:39,407 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-21 18:12:39,407 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure scalbn_double [2018-09-21 18:12:39,407 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure copysign_double [2018-09-21 18:12:39,407 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_pow [2018-09-21 18:12:39,407 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-09-21 18:12:39,408 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-21 18:12:39,428 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2018-09-21 18:12:39,431 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2018-09-21 18:12:39,432 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-09-21 18:12:39,434 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-21 18:12:39,602 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-21 18:12:39,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:12:39,606 INFO L168 Benchmark]: Toolchain (without parser) took 564018.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 951.8 MB in the beginning and 973.2 MB in the end (delta: -21.4 MB). Peak memory consumption was 197.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:39,607 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:12:39,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 919.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:39,607 INFO L168 Benchmark]: Boogie Preprocessor took 140.74 ms. Allocated memory is still 1.0 GB. Free memory was 919.6 MB in the beginning and 914.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:39,608 INFO L168 Benchmark]: RCFGBuilder took 54128.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 914.2 MB in the beginning and 978.3 MB in the end (delta: -64.0 MB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:39,608 INFO L168 Benchmark]: TraceAbstraction took 508806.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 96.5 MB). Free memory was 978.3 MB in the beginning and 1.0 GB in the end (delta: -29.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:39,609 INFO L168 Benchmark]: Witness Printer took 212.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 973.2 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:39,614 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 719.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 919.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 140.74 ms. Allocated memory is still 1.0 GB. Free memory was 919.6 MB in the beginning and 914.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 54128.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 914.2 MB in the beginning and 978.3 MB in the end (delta: -64.0 MB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 508806.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 96.5 MB). Free memory was 978.3 MB in the beginning and 1.0 GB in the end (delta: -29.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. * Witness Printer took 212.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 973.2 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 591]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 513 locations, 1 error locations. SAFE Result, 508.7s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 428.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8836 SDtfs, 8212 SDslu, 54851 SDs, 0 SdLazy, 5867 SolverSat, 237 SolverUnsat, 84 SolverUnknown, 0 SolverNotchecked, 367.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 894 SyntacticMatches, 4 SemanticMatches, 306 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 70.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 629 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 11.9s SatisfiabilityAnalysisTime, 66.9s InterpolantComputationTime, 1072 NumberOfCodeBlocks, 1072 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1055 ConstructedInterpolants, 428 QuantifiedInterpolants, 888181 SizeOfPredicates, 160 NumberOfNonLiveVariables, 3931 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...