./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0874_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_0874_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 961c2aeb6a53bc095902951ff31f208c55ff3f20 ......................................................................................................................................................... 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_0874_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 961c2aeb6a53bc095902951ff31f208c55ff3f20 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:05:16,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:05:16,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:05:16,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:05:16,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:05:16,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:05:16,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:05:16,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:05:16,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:05:16,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:05:16,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:05:16,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:05:16,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:05:16,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:05:16,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:05:16,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:05:16,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:05:16,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:05:16,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:05:16,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:05:16,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:05:16,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:05:16,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:05:16,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:05:16,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:05:16,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:05:16,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:05:16,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:05:16,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:05:16,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:05:16,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:05:16,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:05:16,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:05:16,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:05:16,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:05:16,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:05:16,686 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:05:16,702 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:05:16,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:05:16,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:05:16,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:05:16,703 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:05:16,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:05:16,704 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:05:16,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:05:16,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:05:16,704 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:05:16,704 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:05:16,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:05:16,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:05:16,709 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:05:16,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:05:16,709 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:05:16,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:05:16,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:05:16,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:05:16,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:05:16,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:05:16,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:16,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:05:16,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:05:16,711 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:05:16,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:05:16,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:05:16,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:05:16,711 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 -> 961c2aeb6a53bc095902951ff31f208c55ff3f20 [2019-01-12 09:05:16,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:05:16,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:05:16,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:05:16,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:05:16,775 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:05:16,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0874_true-unreach-call.c [2019-01-12 09:05:16,832 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0133eb408/631bb5120609487ebf05879143e076f2/FLAG0254f02ae [2019-01-12 09:05:17,320 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:05:17,320 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0874_true-unreach-call.c [2019-01-12 09:05:17,333 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0133eb408/631bb5120609487ebf05879143e076f2/FLAG0254f02ae [2019-01-12 09:05:17,634 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0133eb408/631bb5120609487ebf05879143e076f2 [2019-01-12 09:05:17,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:05:17,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:05:17,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:17,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:05:17,645 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:05:17,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:17" (1/1) ... [2019-01-12 09:05:17,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f7c956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:17, skipping insertion in model container [2019-01-12 09:05:17,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:17" (1/1) ... [2019-01-12 09:05:17,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:05:17,722 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:05:18,029 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:834) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:1670) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$35(StandardFunctionHandler.java:316) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:209) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1321) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:540) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1898) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1514) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:964) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1491) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:964) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1343) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3447) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:540) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:190) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) 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) [2019-01-12 09:05:18,037 INFO L168 Benchmark]: Toolchain (without parser) took 398.25 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:18,040 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:18,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.86 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:18,044 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.86 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 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:834) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:05:20,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:05:20,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:05:20,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:05:20,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:05:20,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:05:20,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:05:20,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:05:20,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:05:20,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:05:20,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:05:20,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:05:20,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:05:20,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:05:20,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:05:20,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:05:20,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:05:20,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:05:20,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:05:20,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:05:20,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:05:20,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:05:20,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:05:20,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:05:20,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:05:20,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:05:20,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:05:20,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:05:20,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:05:20,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:05:20,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:05:20,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:05:20,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:05:20,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:05:20,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:05:20,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:05:20,173 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:05:20,188 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:05:20,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:05:20,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:05:20,189 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:05:20,190 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:05:20,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:05:20,190 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:05:20,190 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:05:20,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:05:20,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:05:20,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:05:20,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:05:20,191 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:05:20,191 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:05:20,191 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:05:20,192 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:05:20,192 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:05:20,192 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:05:20,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:05:20,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:05:20,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:05:20,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:05:20,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:20,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:05:20,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:05:20,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:05:20,194 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:05:20,194 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:05:20,194 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:05:20,194 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:05:20,194 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 -> 961c2aeb6a53bc095902951ff31f208c55ff3f20 [2019-01-12 09:05:20,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:05:20,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:05:20,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:05:20,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:05:20,265 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:05:20,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0874_true-unreach-call.c [2019-01-12 09:05:20,332 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47745f08/14c884f8ec594554a80676fcc86b79ad/FLAG9aeed6553 [2019-01-12 09:05:20,918 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:05:20,920 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0874_true-unreach-call.c [2019-01-12 09:05:20,935 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47745f08/14c884f8ec594554a80676fcc86b79ad/FLAG9aeed6553 [2019-01-12 09:05:21,135 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47745f08/14c884f8ec594554a80676fcc86b79ad [2019-01-12 09:05:21,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:05:21,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:05:21,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:21,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:05:21,146 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:05:21,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:21,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167abfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21, skipping insertion in model container [2019-01-12 09:05:21,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:21,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:05:21,215 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:05:21,595 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:21,611 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:05:21,855 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:21,888 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:05:21,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21 WrapperNode [2019-01-12 09:05:21,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:21,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:21,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:05:21,890 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:05:21,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:21,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:21,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:21,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:05:21,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:05:21,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:05:22,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:22,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:22,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:22,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:22,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:22,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:22,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (1/1) ... [2019-01-12 09:05:22,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:05:22,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:05:22,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:05:22,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:05:22,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (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 [2019-01-12 09:05:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:05:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:05:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:05:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:05:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:05:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:05:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:05:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:05:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:05:22,801 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:22,850 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:22,918 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:22,958 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:25,410 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:25,491 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:25,520 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:25,596 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:28,238 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:30,491 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:32,774 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:35,034 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:37,265 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:48,362 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:48,475 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:49,154 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:54,057 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:54,165 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:54,705 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:56,449 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:56,498 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:56,544 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:57,754 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:57,872 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:57,938 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:58,094 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:58,242 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:58,947 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:58,979 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:59,048 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:59,106 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:03,734 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:06,647 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:08,092 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:13,667 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:14,590 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:14,620 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:06:14,620 INFO L286 CfgBuilder]: Removed 98 assue(true) statements. [2019-01-12 09:06:14,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:14 BoogieIcfgContainer [2019-01-12 09:06:14,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:06:14,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:06:14,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:06:14,626 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:06:14,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:05:21" (1/3) ... [2019-01-12 09:06:14,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8f5d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:06:14, skipping insertion in model container [2019-01-12 09:06:14,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:21" (2/3) ... [2019-01-12 09:06:14,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8f5d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:06:14, skipping insertion in model container [2019-01-12 09:06:14,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:14" (3/3) ... [2019-01-12 09:06:14,631 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0874_true-unreach-call.c [2019-01-12 09:06:14,638 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:06:14,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:06:14,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:06:14,702 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:06:14,703 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:06:14,703 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:06:14,703 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:06:14,703 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:06:14,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:06:14,704 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:06:14,704 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:06:14,704 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:06:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2019-01-12 09:06:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:06:14,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:14,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:06:14,738 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash -264009365, now seen corresponding path program 1 times [2019-01-12 09:06:14,751 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:14,751 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 [2019-01-12 09:06:14,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:14,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:14,946 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:14,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:14,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:06:14,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:06:14,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:06:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:06:14,981 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 2 states. [2019-01-12 09:06:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:15,027 INFO L93 Difference]: Finished difference Result 442 states and 754 transitions. [2019-01-12 09:06:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:06:15,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-01-12 09:06:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:15,044 INFO L225 Difference]: With dead ends: 442 [2019-01-12 09:06:15,045 INFO L226 Difference]: Without dead ends: 218 [2019-01-12 09:06:15,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:06:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-12 09:06:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-01-12 09:06:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-01-12 09:06:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 296 transitions. [2019-01-12 09:06:15,106 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 296 transitions. Word has length 17 [2019-01-12 09:06:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:15,106 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 296 transitions. [2019-01-12 09:06:15,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:06:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 296 transitions. [2019-01-12 09:06:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:06:15,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:15,109 INFO L402 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] [2019-01-12 09:06:15,109 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1586530375, now seen corresponding path program 1 times [2019-01-12 09:06:15,112 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:15,113 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 [2019-01-12 09:06:15,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:15,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:15,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:15,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:06:15,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:06:15,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:06:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:06:15,694 INFO L87 Difference]: Start difference. First operand 218 states and 296 transitions. Second operand 6 states. [2019-01-12 09:06:16,151 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-12 09:06:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:22,316 INFO L93 Difference]: Finished difference Result 351 states and 468 transitions. [2019-01-12 09:06:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:06:22,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 09:06:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:22,467 INFO L225 Difference]: With dead ends: 351 [2019-01-12 09:06:22,468 INFO L226 Difference]: Without dead ends: 152 [2019-01-12 09:06:22,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:06:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-12 09:06:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2019-01-12 09:06:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-12 09:06:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2019-01-12 09:06:22,485 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 22 [2019-01-12 09:06:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:22,486 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2019-01-12 09:06:22,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:06:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2019-01-12 09:06:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:06:22,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:22,488 INFO L402 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] [2019-01-12 09:06:22,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash 199776244, now seen corresponding path program 1 times [2019-01-12 09:06:22,490 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:22,491 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 [2019-01-12 09:06:22,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:22,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:22,827 INFO L478 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 54 treesize of output 48 [2019-01-12 09:06:22,837 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-01-12 09:06:22,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:06:22,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:06:22,902 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. [2019-01-12 09:06:22,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2019-01-12 09:06:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:28,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:28,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:28,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:06:28,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:06:28,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:06:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=71, Unknown=2, NotChecked=0, Total=90 [2019-01-12 09:06:28,334 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand 10 states. [2019-01-12 09:06:34,777 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 09:06:35,683 WARN L181 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-12 09:06:38,116 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-12 09:06:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:42,403 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2019-01-12 09:06:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:06:42,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-12 09:06:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:42,407 INFO L225 Difference]: With dead ends: 161 [2019-01-12 09:06:42,407 INFO L226 Difference]: Without dead ends: 61 [2019-01-12 09:06:42,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=75, Invalid=228, Unknown=3, NotChecked=0, Total=306 [2019-01-12 09:06:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-12 09:06:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-01-12 09:06:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 09:06:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-01-12 09:06:42,427 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2019-01-12 09:06:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:42,427 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-12 09:06:42,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:06:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-01-12 09:06:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:06:42,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:42,430 INFO L402 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] [2019-01-12 09:06:42,430 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -609570382, now seen corresponding path program 1 times [2019-01-12 09:06:42,432 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:42,432 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 [2019-01-12 09:06:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:42,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:42,984 INFO L478 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 54 treesize of output 48 [2019-01-12 09:06:42,998 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-01-12 09:06:42,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:06:43,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:06:43,035 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. [2019-01-12 09:06:43,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:43 [2019-01-12 09:06:47,610 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-12 09:06:47,627 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:47,628 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:47,631 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2019-01-12 09:06:47,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:47,712 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:47,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2019-01-12 09:06:47,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:06:47,751 INFO L478 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 24 treesize of output 18 [2019-01-12 09:06:47,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:47,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-12 09:06:47,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:06:47,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:06:47,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:06:47,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-12 09:06:47,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:97, output treesize:69 [2019-01-12 09:06:48,545 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-12 09:06:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:48,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:48,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:48,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 09:06:48,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:06:48,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:06:48,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=90, Unknown=1, NotChecked=0, Total=110 [2019-01-12 09:06:48,596 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 11 states. [2019-01-12 09:06:49,818 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-12 09:06:51,123 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-12 09:06:52,548 WARN L181 SmtUtils]: Spent 922.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-12 09:06:55,216 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 69 [2019-01-12 09:06:57,218 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 79 [2019-01-12 09:06:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:57,752 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-01-12 09:06:57,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:06:57,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-01-12 09:06:57,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:57,758 INFO L225 Difference]: With dead ends: 61 [2019-01-12 09:06:57,758 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 09:06:57,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=85, Invalid=256, Unknown=1, NotChecked=0, Total=342 [2019-01-12 09:06:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 09:06:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 09:06:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:06:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-12 09:06:57,782 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 24 [2019-01-12 09:06:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:57,782 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-12 09:06:57,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:06:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-12 09:06:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:06:57,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:57,785 INFO L402 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] [2019-01-12 09:06:57,786 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1865467459, now seen corresponding path program 1 times [2019-01-12 09:06:57,787 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:57,787 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 [2019-01-12 09:06:57,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:58,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:58,282 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:58,283 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:58,284 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:58,284 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:58,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2019-01-12 09:06:58,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:58,314 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2019-01-12 09:06:58,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:06:58,356 INFO L478 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 36 treesize of output 28 [2019-01-12 09:06:58,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:58,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:58,368 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:58,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-12 09:06:58,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:06:58,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:06:58,439 INFO L478 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 33 treesize of output 25 [2019-01-12 09:06:58,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:58,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-01-12 09:06:58,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:06:58,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:06:58,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:06:58,492 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. [2019-01-12 09:06:58,493 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:35 [2019-01-12 09:06:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:58,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:58,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:58,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:06:58,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:06:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:06:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:06:58,982 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 10 states. [2019-01-12 09:07:00,206 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-12 09:07:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:00,208 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-12 09:07:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:07:00,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-01-12 09:07:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:00,209 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:07:00,209 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:07:00,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:07:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:07:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:07:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:07:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:07:00,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-12 09:07:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:00,211 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:07:00,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:07:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:07:00,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:07:00,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:07:00,754 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-01-12 09:07:05,634 WARN L181 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-01-12 09:07:10,338 WARN L181 SmtUtils]: Spent 4.70 s on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2019-01-12 09:07:10,506 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-01-12 09:07:11,769 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 113 DAG size of output: 82 [2019-01-12 09:07:11,799 INFO L444 ceAbstractionStarter]: At program point L35-2(lines 17 36) the Hoare annotation is: false [2019-01-12 09:07:11,799 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 499) no Hoare annotation was computed. [2019-01-12 09:07:11,800 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 570) no Hoare annotation was computed. [2019-01-12 09:07:11,800 INFO L444 ceAbstractionStarter]: At program point L565-2(lines 565 570) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (let ((.cse2 (fp.neg .cse0))) (and (= .cse0 ULTIMATE.start_main_~y~0) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= ULTIMATE.start_fabs_double_~x (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_isinf_double_~x .cse2) (exists ((|v_q#valueAsBitvector_38| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~ly~0) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_38|) ((_ extract 62 52) |v_q#valueAsBitvector_38|) ((_ extract 51 0) |v_q#valueAsBitvector_38|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~hy~1))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (fp.lt (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59))))) (= ULTIMATE.start___ieee754_pow_~y .cse0) (exists ((|v_q#valueAsBitvector_38| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_38|))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_38|) ((_ extract 62 52) |v_q#valueAsBitvector_38|) ((_ extract 51 0) |v_q#valueAsBitvector_38|))))) (= |ULTIMATE.start___ieee754_pow_#res| .cse2) (exists ((v_prenex_59 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) v_prenex_59) ULTIMATE.start_fabs_double_~high~0))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (exists ((v_prenex_60 (_ BitVec 64)) (v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) (fp ((_ extract 63 63) v_prenex_60) ((_ extract 62 52) v_prenex_60) ((_ extract 51 0) v_prenex_60))) (= ((_ extract 63 32) v_prenex_60) ULTIMATE.start___ieee754_pow_~hx~2) (fp.lt (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((v_prenex_60 (_ BitVec 64)) (v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) (fp ((_ extract 63 63) v_prenex_60) ((_ extract 62 52) v_prenex_60) ((_ extract 51 0) v_prenex_60))) (fp.lt (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_60)) ULTIMATE.start___ieee754_pow_~ix~0)))))) [2019-01-12 09:07:11,800 INFO L448 ceAbstractionStarter]: For program point L565-3(lines 565 570) no Hoare annotation was computed. [2019-01-12 09:07:11,800 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 302) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L501(lines 501 508) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L501-2(lines 494 508) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 307) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 507) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 306) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 372 377) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L444 ceAbstractionStarter]: At program point L372-2(lines 372 377) the Hoare annotation is: false [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L372-3(lines 372 377) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 506) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 190) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 44 49) no Hoare annotation was computed. [2019-01-12 09:07:11,801 INFO L444 ceAbstractionStarter]: At program point L44-2(lines 44 49) the Hoare annotation is: false [2019-01-12 09:07:11,802 INFO L448 ceAbstractionStarter]: For program point L44-3(lines 44 49) no Hoare annotation was computed. [2019-01-12 09:07:11,803 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 441 446) no Hoare annotation was computed. [2019-01-12 09:07:11,803 INFO L444 ceAbstractionStarter]: At program point L441-2(lines 441 446) the Hoare annotation is: false [2019-01-12 09:07:11,803 INFO L448 ceAbstractionStarter]: For program point L441-3(lines 441 446) no Hoare annotation was computed. [2019-01-12 09:07:11,804 INFO L444 ceAbstractionStarter]: At program point L574(lines 563 575) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (let ((.cse2 (fp.neg .cse0))) (and (= .cse0 ULTIMATE.start_main_~y~0) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= ULTIMATE.start_fabs_double_~x (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_isinf_double_~x .cse2) (exists ((v_prenex_62 (_ BitVec 64)) (|v_q#valueAsBitvector_39| (_ BitVec 64))) (let ((.cse3 ((_ extract 63 32) |v_q#valueAsBitvector_39|)) (.cse4 ((_ extract 31 0) v_prenex_62))) (and (= ((_ extract 63 32) v_prenex_62) .cse3) (= .cse4 ((_ extract 31 0) |v_q#valueAsBitvector_39|)) (= (bvadd (bvneg (bvlshr (let ((.cse5 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) .cse3) (bvlshr (bvor .cse4 (bvneg .cse4)) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse5 (bvneg .cse5))) (_ bv31 32))) (_ bv1 32)) |ULTIMATE.start_isinf_double_#res|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_39|) ((_ extract 62 52) |v_q#valueAsBitvector_39|) ((_ extract 51 0) |v_q#valueAsBitvector_39|)) (fp.neg (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))))) (exists ((|v_q#valueAsBitvector_38| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~ly~0) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_38|) ((_ extract 62 52) |v_q#valueAsBitvector_38|) ((_ extract 51 0) |v_q#valueAsBitvector_38|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~hy~1))) (exists ((|v_q#valueAsBitvector_38| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_38|))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_38|) ((_ extract 62 52) |v_q#valueAsBitvector_38|) ((_ extract 51 0) |v_q#valueAsBitvector_38|))))) (exists ((v_prenex_60 (_ BitVec 64)) (v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) (fp ((_ extract 63 63) v_prenex_60) ((_ extract 62 52) v_prenex_60) ((_ extract 51 0) v_prenex_60))) (= ((_ extract 63 32) v_prenex_60) ULTIMATE.start___ieee754_pow_~hx~2) (fp.lt (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (fp.lt (let ((.cse7 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59))))) (= ULTIMATE.start___ieee754_pow_~y .cse0) (= |ULTIMATE.start___ieee754_pow_#res| .cse2) (exists ((v_prenex_59 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) v_prenex_59) ULTIMATE.start_fabs_double_~high~0))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse8 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))) (exists ((v_prenex_60 (_ BitVec 64)) (v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) (fp ((_ extract 63 63) v_prenex_60) ((_ extract 62 52) v_prenex_60) ((_ extract 51 0) v_prenex_60))) (fp.lt (let ((.cse9 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_60)) ULTIMATE.start___ieee754_pow_~ix~0)))))) [2019-01-12 09:07:11,804 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-01-12 09:07:11,804 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 117) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L112-2(lines 112 117) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 332) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 116) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 188) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 318) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 116) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 527) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L513-2(lines 513 527) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 318) no Hoare annotation was computed. [2019-01-12 09:07:11,805 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 188) no Hoare annotation was computed. [2019-01-12 09:07:11,806 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 63) no Hoare annotation was computed. [2019-01-12 09:07:11,807 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 42 92) no Hoare annotation was computed. [2019-01-12 09:07:11,807 INFO L448 ceAbstractionStarter]: For program point L316(line 316) no Hoare annotation was computed. [2019-01-12 09:07:11,807 INFO L448 ceAbstractionStarter]: For program point L316-2(line 316) no Hoare annotation was computed. [2019-01-12 09:07:11,807 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 185) no Hoare annotation was computed. [2019-01-12 09:07:11,807 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 185) no Hoare annotation was computed. [2019-01-12 09:07:11,807 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-01-12 09:07:11,807 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 391) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L383-1(lines 383 391) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L318-2(line 318) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 131) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 131) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 517 522) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L444 ceAbstractionStarter]: At program point L517-2(lines 517 522) the Hoare annotation is: false [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L517-3(lines 517 522) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L444 ceAbstractionStarter]: At program point L121-2(lines 121 125) the Hoare annotation is: false [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L121-3(lines 121 125) no Hoare annotation was computed. [2019-01-12 09:07:11,808 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 55 59) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L444 ceAbstractionStarter]: At program point L55-2(lines 55 59) the Hoare annotation is: false [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point L55-3(lines 55 59) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point L386-1(lines 386 390) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 325) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L444 ceAbstractionStarter]: At program point L386-2(lines 386 390) the Hoare annotation is: false [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 453 458) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L444 ceAbstractionStarter]: At program point L453-2(lines 453 458) the Hoare annotation is: false [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point L453-3(lines 453 458) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 324) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:07:11,809 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 598) no Hoare annotation was computed. [2019-01-12 09:07:11,810 INFO L448 ceAbstractionStarter]: For program point L588-2(lines 588 598) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 595) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L126-2(lines 126 127) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L444 ceAbstractionStarter]: At program point L126-3(lines 126 127) the Hoare annotation is: false [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L126-4(lines 126 127) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 194) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L193-2(lines 193 194) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 525) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L524-2(lines 524 525) no Hoare annotation was computed. [2019-01-12 09:07:11,811 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 327) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 331) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 196 201) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L444 ceAbstractionStarter]: At program point L196-2(lines 196 201) the Hoare annotation is: false [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L196-3(lines 196 201) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 330) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 597) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 404) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 529 534) no Hoare annotation was computed. [2019-01-12 09:07:11,812 INFO L444 ceAbstractionStarter]: At program point L529-2(lines 529 534) the Hoare annotation is: false [2019-01-12 09:07:11,813 INFO L448 ceAbstractionStarter]: For program point L529-3(lines 529 534) no Hoare annotation was computed. [2019-01-12 09:07:11,815 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 68) no Hoare annotation was computed. [2019-01-12 09:07:11,815 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2019-01-12 09:07:11,815 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 137) no Hoare annotation was computed. [2019-01-12 09:07:11,815 INFO L448 ceAbstractionStarter]: For program point L134-2(lines 134 137) no Hoare annotation was computed. [2019-01-12 09:07:11,816 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 465 470) no Hoare annotation was computed. [2019-01-12 09:07:11,816 INFO L444 ceAbstractionStarter]: At program point L465-2(lines 465 470) the Hoare annotation is: false [2019-01-12 09:07:11,816 INFO L448 ceAbstractionStarter]: For program point L465-3(lines 465 470) no Hoare annotation was computed. [2019-01-12 09:07:11,816 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 77) no Hoare annotation was computed. [2019-01-12 09:07:11,816 INFO L448 ceAbstractionStarter]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2019-01-12 09:07:11,816 INFO L444 ceAbstractionStarter]: At program point L268-2(lines 268 273) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start_main_~y~0) (exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_prenex_57 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_57) ((_ extract 62 52) v_prenex_57) ((_ extract 51 0) v_prenex_57)) ULTIMATE.start_main_~x~0) (= (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_57)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ULTIMATE.start_fabs_double_~x))) (= ULTIMATE.start___ieee754_pow_~y .cse0) (exists ((v_prenex_59 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) v_prenex_59) ULTIMATE.start_fabs_double_~high~0))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) (exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_prenex_57 (_ BitVec 64))) (and (fp.lt (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_57)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) v_prenex_57) ((_ extract 62 52) v_prenex_57) ((_ extract 51 0) v_prenex_57))))))) [2019-01-12 09:07:11,816 INFO L444 ceAbstractionStarter]: At program point L202(lines 95 203) the Hoare annotation is: false [2019-01-12 09:07:11,817 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 70 75) no Hoare annotation was computed. [2019-01-12 09:07:11,817 INFO L444 ceAbstractionStarter]: At program point L70-2(lines 70 75) the Hoare annotation is: false [2019-01-12 09:07:11,817 INFO L448 ceAbstractionStarter]: For program point L70-3(lines 70 75) no Hoare annotation was computed. [2019-01-12 09:07:11,817 INFO L451 ceAbstractionStarter]: At program point L600(lines 577 601) the Hoare annotation is: true [2019-01-12 09:07:11,817 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 349) no Hoare annotation was computed. [2019-01-12 09:07:11,817 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 261 560) no Hoare annotation was computed. [2019-01-12 09:07:11,817 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 348) no Hoare annotation was computed. [2019-01-12 09:07:11,817 INFO L448 ceAbstractionStarter]: For program point L206-1(lines 206 210) no Hoare annotation was computed. [2019-01-12 09:07:11,817 INFO L444 ceAbstractionStarter]: At program point L206-2(lines 206 210) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fabs_double_~x ULTIMATE.start_main_~x~0)) [2019-01-12 09:07:11,817 INFO L448 ceAbstractionStarter]: For program point L206-5(lines 206 210) no Hoare annotation was computed. [2019-01-12 09:07:11,817 INFO L444 ceAbstractionStarter]: At program point L206-6(lines 206 210) the Hoare annotation is: false [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 410) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L405-1(lines 379 472) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 340) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L405-2(lines 405 410) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L339-2(lines 337 348) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 279) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L274-1(lines 261 560) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 274 279) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 345) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 83) no Hoare annotation was computed. [2019-01-12 09:07:11,818 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 476) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L475-2(lines 475 476) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 216) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L211-1(lines 204 218) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L211-2(lines 211 216) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L211-3(lines 211 216) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L444 ceAbstractionStarter]: At program point L145-2(lines 145 155) the Hoare annotation is: false [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L211-4(lines 204 218) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L79(lines 79 82) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L145-3(lines 145 155) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L211-5(lines 211 216) no Hoare annotation was computed. [2019-01-12 09:07:11,819 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 345) no Hoare annotation was computed. [2019-01-12 09:07:11,820 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 151) no Hoare annotation was computed. [2019-01-12 09:07:11,820 INFO L448 ceAbstractionStarter]: For program point L147-2(lines 147 151) no Hoare annotation was computed. [2019-01-12 09:07:11,820 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 544 548) no Hoare annotation was computed. [2019-01-12 09:07:11,820 INFO L444 ceAbstractionStarter]: At program point L544-2(lines 544 548) the Hoare annotation is: false [2019-01-12 09:07:11,820 INFO L448 ceAbstractionStarter]: For program point L544-3(lines 544 548) no Hoare annotation was computed. [2019-01-12 09:07:11,820 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 479 484) no Hoare annotation was computed. [2019-01-12 09:07:11,820 INFO L444 ceAbstractionStarter]: At program point L479-2(lines 479 484) the Hoare annotation is: false [2019-01-12 09:07:11,820 INFO L448 ceAbstractionStarter]: For program point L479-3(lines 479 484) no Hoare annotation was computed. [2019-01-12 09:07:11,820 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 284) no Hoare annotation was computed. [2019-01-12 09:07:11,821 INFO L444 ceAbstractionStarter]: At program point L217(lines 204 218) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~y~0) (exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_prenex_57 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_57) ((_ extract 62 52) v_prenex_57) ((_ extract 51 0) v_prenex_57)) ULTIMATE.start_main_~x~0) (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_57)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_fabs_double_~x))) (exists ((v_prenex_59 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) v_prenex_59) ULTIMATE.start_fabs_double_~high~0))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))))) [2019-01-12 09:07:11,821 INFO L444 ceAbstractionStarter]: At program point L217-1(lines 204 218) the Hoare annotation is: false [2019-01-12 09:07:11,821 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2019-01-12 09:07:11,821 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 90) the Hoare annotation is: false [2019-01-12 09:07:11,821 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:07:11,821 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 90) no Hoare annotation was computed. [2019-01-12 09:07:11,821 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:07:11,821 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:07:11,821 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:07:11,821 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:07:11,821 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L416-1(lines 416 421) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L444 ceAbstractionStarter]: At program point L416-2(lines 416 421) the Hoare annotation is: false [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L416-3(lines 416 421) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L550(lines 550 558) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 472) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 291) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L354-2(lines 354 472) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 28) no Hoare annotation was computed. [2019-01-12 09:07:11,822 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 36) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 28) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 36) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 28) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 36) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 553 558) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L444 ceAbstractionStarter]: At program point L553-2(lines 553 558) the Hoare annotation is: false [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L553-3(lines 550 558) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L355-2(lines 354 379) no Hoare annotation was computed. [2019-01-12 09:07:11,823 INFO L444 ceAbstractionStarter]: At program point L91(lines 42 92) the Hoare annotation is: false [2019-01-12 09:07:11,823 INFO L448 ceAbstractionStarter]: For program point L488-1(lines 488 493) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L444 ceAbstractionStarter]: At program point L488-2(lines 488 493) the Hoare annotation is: false [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L488-3(lines 261 560) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 357) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L444 ceAbstractionStarter]: At program point L158-2(lines 158 174) the Hoare annotation is: false [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L158-3(lines 95 203) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L357(line 357) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L357-2(line 357) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 424 429) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 359) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L444 ceAbstractionStarter]: At program point L424-2(lines 424 429) the Hoare annotation is: false [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L424-3(lines 424 429) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:07:11,824 INFO L448 ceAbstractionStarter]: For program point L359(line 359) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L359-2(line 359) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 170) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 170) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 17 36) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29-4(lines 17 36) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29-5(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29-6(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:07:11,825 INFO L448 ceAbstractionStarter]: For program point L29-7(lines 17 36) no Hoare annotation was computed. [2019-01-12 09:07:11,826 INFO L448 ceAbstractionStarter]: For program point L29-8(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:07:11,826 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 309) no Hoare annotation was computed. [2019-01-12 09:07:11,826 INFO L448 ceAbstractionStarter]: For program point L294-1(lines 261 560) no Hoare annotation was computed. [2019-01-12 09:07:11,826 INFO L444 ceAbstractionStarter]: At program point L559(lines 261 560) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start_main_~y~0) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= ULTIMATE.start_fabs_double_~x (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0))) (exists ((|v_q#valueAsBitvector_38| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~ly~0) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_38|) ((_ extract 62 52) |v_q#valueAsBitvector_38|) ((_ extract 51 0) |v_q#valueAsBitvector_38|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~hy~1))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (fp.lt (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59))))) (= ULTIMATE.start___ieee754_pow_~y .cse0) (exists ((|v_q#valueAsBitvector_38| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_38|) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_38|))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_38|) ((_ extract 62 52) |v_q#valueAsBitvector_38|) ((_ extract 51 0) |v_q#valueAsBitvector_38|))))) (= |ULTIMATE.start___ieee754_pow_#res| (fp.neg .cse0)) (exists ((v_prenex_59 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) v_prenex_59) ULTIMATE.start_fabs_double_~high~0))) (exists ((v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((v_prenex_60 (_ BitVec 64)) (v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) (fp ((_ extract 63 63) v_prenex_60) ((_ extract 62 52) v_prenex_60) ((_ extract 51 0) v_prenex_60))) (= ((_ extract 63 32) v_prenex_60) ULTIMATE.start___ieee754_pow_~hx~2) (fp.lt (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((v_prenex_60 (_ BitVec 64)) (v_prenex_59 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_59) ((_ extract 62 52) v_prenex_59) ((_ extract 51 0) v_prenex_59)) (fp ((_ extract 63 63) v_prenex_60) ((_ extract 62 52) v_prenex_60) ((_ extract 51 0) v_prenex_60))) (fp.lt (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_59)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_60)) ULTIMATE.start___ieee754_pow_~ix~0))))) [2019-01-12 09:07:11,826 INFO L448 ceAbstractionStarter]: For program point L295(lines 295 308) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 164) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L163-2(lines 163 164) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 500) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L363(line 363) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 308) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L363-2(line 363) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 365) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 167) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L166-2(lines 166 167) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L365(line 365) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 307) no Hoare annotation was computed. [2019-01-12 09:07:11,827 INFO L448 ceAbstractionStarter]: For program point L365-2(line 365) no Hoare annotation was computed. [2019-01-12 09:07:11,828 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 101 106) no Hoare annotation was computed. [2019-01-12 09:07:11,830 INFO L444 ceAbstractionStarter]: At program point L101-2(lines 101 106) the Hoare annotation is: false [2019-01-12 09:07:11,830 INFO L444 ceAbstractionStarter]: At program point L35(lines 17 36) the Hoare annotation is: false [2019-01-12 09:07:11,830 INFO L448 ceAbstractionStarter]: For program point L101-3(lines 95 203) no Hoare annotation was computed. [2019-01-12 09:07:11,830 INFO L444 ceAbstractionStarter]: At program point L35-1(lines 17 36) the Hoare annotation is: false [2019-01-12 09:07:11,846 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2019-01-12 09:07:11,851 INFO L168 Benchmark]: Toolchain (without parser) took 110711.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 947.3 MB in the beginning and 874.6 MB in the end (delta: 72.8 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:11,852 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:07:11,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:11,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:11,856 INFO L168 Benchmark]: Boogie Preprocessor took 106.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:11,857 INFO L168 Benchmark]: RCFGBuilder took 52518.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 118.7 MB). Peak memory consumption was 118.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:11,857 INFO L168 Benchmark]: TraceAbstraction took 57227.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 992.7 MB in the beginning and 874.6 MB in the end (delta: 118.2 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:11,867 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 747.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 52518.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 118.7 MB). Peak memory consumption was 118.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57227.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 992.7 MB in the beginning and 874.6 MB in the end (delta: 118.2 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 595]: 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 - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 0 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...