./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71d15b3186fc16a974d38e1f9340cf7de3285c68 ............................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71d15b3186fc16a974d38e1f9340cf7de3285c68 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 14:52:42,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:52:42,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:52:42,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:52:42,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:52:42,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:52:42,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:52:42,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:52:43,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:52:43,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:52:43,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:52:43,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:52:43,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:52:43,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:52:43,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:52:43,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:52:43,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:52:43,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:52:43,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:52:43,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:52:43,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:52:43,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:52:43,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:52:43,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:52:43,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:52:43,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:52:43,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:52:43,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:52:43,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:52:43,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:52:43,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:52:43,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:52:43,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:52:43,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:52:43,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:52:43,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:52:43,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:52:43,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:52:43,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:52:43,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:52:43,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:52:43,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 14:52:43,146 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:52:43,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:52:43,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:52:43,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:52:43,152 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:52:43,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:52:43,152 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:52:43,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 14:52:43,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:52:43,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:52:43,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:52:43,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:52:43,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:52:43,154 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:52:43,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:52:43,155 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:52:43,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:52:43,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:52:43,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:52:43,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:52:43,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:52:43,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:52:43,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:52:43,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:52:43,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:52:43,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 14:52:43,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 14:52:43,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:52:43,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:52:43,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 71d15b3186fc16a974d38e1f9340cf7de3285c68 [2020-12-02 14:52:43,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:52:43,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:52:43,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:52:43,624 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:52:43,625 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:52:43,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c [2020-12-02 14:52:43,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/333ab4dcc/c55a1e1666434936accaa20aea113b55/FLAGd7ba8ddcd [2020-12-02 14:52:44,442 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:52:44,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c [2020-12-02 14:52:44,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/333ab4dcc/c55a1e1666434936accaa20aea113b55/FLAGd7ba8ddcd [2020-12-02 14:52:44,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/333ab4dcc/c55a1e1666434936accaa20aea113b55 [2020-12-02 14:52:44,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:52:44,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:52:44,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:52:44,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:52:44,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:52:44,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:44" (1/1) ... [2020-12-02 14:52:44,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740b8fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:44, skipping insertion in model container [2020-12-02 14:52:44,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:44" (1/1) ... [2020-12-02 14:52:44,849 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:52:44,871 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:52:45,128 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c[570,583] [2020-12-02 14:52:45,151 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: conversion from bitvector to float not supported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.transformBitvectorToFloat(IntegerTranslation.java:919) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.ExpressionTranslation.constructUnaryExpression(ExpressionTranslation.java:141) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CExpressionTranslator.handleUnaryArithmeticOperators(CExpressionTranslator.java:407) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2351) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:705) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1351) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1044) 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:1422) 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:3209) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2291) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:578) 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:201) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-02 14:52:45,162 INFO L168 Benchmark]: Toolchain (without parser) took 339.37 ms. Allocated memory is still 48.2 MB. Free memory was 25.8 MB in the beginning and 28.8 MB in the end (delta: -3.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-02 14:52:45,165 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 35.7 MB. Free memory was 17.9 MB in the beginning and 17.8 MB in the end (delta: 17.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:52:45,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.14 ms. Allocated memory is still 48.2 MB. Free memory was 25.6 MB in the beginning and 28.8 MB in the end (delta: -3.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-02 14:52:45,173 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 35.7 MB. Free memory was 17.9 MB in the beginning and 17.8 MB in the end (delta: 17.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 331.14 ms. Allocated memory is still 48.2 MB. Free memory was 25.6 MB in the beginning and 28.8 MB in the end (delta: -3.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: conversion from bitvector to float not supported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: conversion from bitvector to float not supported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.transformBitvectorToFloat(IntegerTranslation.java:919) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-2880296 [2020-12-02 14:52:47,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:52:47,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:52:47,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:52:47,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:52:47,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:52:47,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:52:47,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:52:47,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:52:47,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:52:47,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:52:47,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:52:47,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:52:47,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:52:47,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:52:47,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:52:47,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:52:47,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:52:47,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:52:47,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:52:47,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:52:47,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:52:47,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:52:47,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:52:47,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:52:47,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:52:47,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:52:47,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:52:47,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:52:47,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:52:47,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:52:47,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:52:47,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:52:47,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:52:47,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:52:47,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:52:47,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:52:47,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:52:47,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:52:47,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:52:47,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:52:47,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 14:52:47,835 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:52:47,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:52:47,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:52:47,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:52:47,838 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:52:47,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:52:47,838 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:52:47,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:52:47,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:52:47,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:52:47,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:52:47,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:52:47,840 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 14:52:47,840 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 14:52:47,840 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:52:47,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:52:47,840 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:52:47,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:52:47,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:52:47,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:52:47,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:52:47,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:52:47,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:52:47,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:52:47,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:52:47,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:52:47,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 14:52:47,843 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 14:52:47,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:52:47,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:52:47,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 14:52:47,844 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 71d15b3186fc16a974d38e1f9340cf7de3285c68 [2020-12-02 14:52:48,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:52:48,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:52:48,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:52:48,425 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:52:48,426 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:52:48,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c [2020-12-02 14:52:48,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee3a4c75/be4f722144f14a90bf71cf233fe4fbcc/FLAGf1bf7f6af [2020-12-02 14:52:49,090 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:52:49,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c [2020-12-02 14:52:49,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee3a4c75/be4f722144f14a90bf71cf233fe4fbcc/FLAGf1bf7f6af [2020-12-02 14:52:49,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee3a4c75/be4f722144f14a90bf71cf233fe4fbcc [2020-12-02 14:52:49,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:52:49,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:52:49,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:52:49,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:52:49,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:52:49,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:49" (1/1) ... [2020-12-02 14:52:49,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e110c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:49, skipping insertion in model container [2020-12-02 14:52:49,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:49" (1/1) ... [2020-12-02 14:52:49,451 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:52:49,470 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:52:49,780 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c[570,583] [2020-12-02 14:52:49,870 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:52:49,902 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 14:52:49,926 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c[570,583] [2020-12-02 14:52:49,979 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:52:50,002 INFO L217 MainTranslator]: Completed translation [2020-12-02 14:52:50,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50 WrapperNode [2020-12-02 14:52:50,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 14:52:50,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 14:52:50,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 14:52:50,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 14:52:50,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 14:52:50,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 14:52:50,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 14:52:50,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 14:52:50,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (1/1) ... [2020-12-02 14:52:50,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 14:52:50,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 14:52:50,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 14:52:50,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 14:52:50,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (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 [2020-12-02 14:52:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-02 14:52:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 14:52:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 14:52:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 14:52:50,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 14:53:00,748 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 14:53:00,749 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-12-02 14:53:00,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:00 BoogieIcfgContainer [2020-12-02 14:53:00,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 14:53:00,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 14:53:00,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 14:53:00,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 14:53:00,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:52:49" (1/3) ... [2020-12-02 14:53:00,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dc3523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:53:00, skipping insertion in model container [2020-12-02 14:53:00,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:50" (2/3) ... [2020-12-02 14:53:00,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dc3523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:53:00, skipping insertion in model container [2020-12-02 14:53:00,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:00" (3/3) ... [2020-12-02 14:53:00,770 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant.c [2020-12-02 14:53:00,786 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 14:53:00,791 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 14:53:00,804 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 14:53:00,846 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 14:53:00,846 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 14:53:00,846 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 14:53:00,847 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 14:53:00,847 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 14:53:00,847 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 14:53:00,847 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 14:53:00,847 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 14:53:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-12-02 14:53:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 14:53:00,881 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:53:00,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:53:00,883 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:53:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:53:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1848327101, now seen corresponding path program 1 times [2020-12-02 14:53:00,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:53:00,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971134910] [2020-12-02 14:53:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 14:53:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:53:02,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-02 14:53:02,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:53:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:53:02,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:53:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:53:02,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971134910] [2020-12-02 14:53:02,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:53:02,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-02 14:53:02,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671398359] [2020-12-02 14:53:02,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 14:53:02,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:53:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 14:53:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 14:53:02,938 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-12-02 14:53:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:53:02,961 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2020-12-02 14:53:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 14:53:02,963 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2020-12-02 14:53:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:53:02,973 INFO L225 Difference]: With dead ends: 46 [2020-12-02 14:53:02,973 INFO L226 Difference]: Without dead ends: 20 [2020-12-02 14:53:02,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 14:53:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-02 14:53:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-02 14:53:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-02 14:53:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-12-02 14:53:03,017 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2020-12-02 14:53:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:53:03,017 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-12-02 14:53:03,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 14:53:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-12-02 14:53:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 14:53:03,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:53:03,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:53:03,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 14:53:03,233 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:53:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:53:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1745575617, now seen corresponding path program 1 times [2020-12-02 14:53:03,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:53:03,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617884145] [2020-12-02 14:53:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 14:53:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:53:04,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-02 14:53:04,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:53:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:53:05,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:53:05,197 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:53:05,198 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:53:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:53:05,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617884145] [2020-12-02 14:53:05,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:53:05,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-02 14:53:05,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185177418] [2020-12-02 14:53:05,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 14:53:05,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:53:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 14:53:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:53:05,210 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2020-12-02 14:53:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:53:06,218 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-12-02 14:53:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 14:53:06,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-02 14:53:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:53:06,221 INFO L225 Difference]: With dead ends: 40 [2020-12-02 14:53:06,221 INFO L226 Difference]: Without dead ends: 20 [2020-12-02 14:53:06,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 14:53:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-02 14:53:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-02 14:53:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-02 14:53:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-12-02 14:53:06,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2020-12-02 14:53:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:53:06,227 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-12-02 14:53:06,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 14:53:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-12-02 14:53:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 14:53:06,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:53:06,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:53:06,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 14:53:06,445 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:53:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:53:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1158769603, now seen corresponding path program 1 times [2020-12-02 14:53:06,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:53:06,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371197796] [2020-12-02 14:53:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 14:53:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:53:08,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-02 14:53:08,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:53:08,638 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-02 14:53:08,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:08,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-02 14:53:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:53:08,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:53:11,078 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_SqrtR_~residu~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_9| (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~linf~0_9 (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~lsup~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~lsup~0_9))) (.cse5 (let ((.cse8 (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xn~0)))) (fp.add c_~CRM .cse8 .cse8))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~residu~0_9)))) (or (not (= (fp.mul c_~CRM .cse0 .cse1) .cse2)) (not (= .cse3 (fp.mul c_~CRM .cse4 .cse0))) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse4)) (not (= .cse5 .cse6)) (fp.gt .cse7 .cse2) (not (= .cse5 .cse1)) (not (= .cse7 (fp.mul c_~CRM .cse3 .cse6))) (fp.lt .cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~linf~0_9)))))) is different from false [2020-12-02 14:53:13,205 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_SqrtR_~residu~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_9| (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~linf~0_9 (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~lsup~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~lsup~0_9))) (.cse5 (let ((.cse8 (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xn~0)))) (fp.add c_~CRM .cse8 .cse8))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~residu~0_9)))) (or (not (= (fp.mul c_~CRM .cse0 .cse1) .cse2)) (not (= .cse3 (fp.mul c_~CRM .cse4 .cse0))) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse4)) (not (= .cse5 .cse6)) (fp.gt .cse7 .cse2) (not (= .cse5 .cse1)) (not (= .cse7 (fp.mul c_~CRM .cse3 .cse6))) (fp.lt .cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~linf~0_9)))))) is different from true [2020-12-02 14:53:15,859 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_SqrtR_~residu~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_9| (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~xn~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_9| (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~linf~0_9 (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~lsup~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_9| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~xn~0_12) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~xn~0_12) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~xn~0_12)))) (let ((.cse2 (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))) (.cse1 (fp.add c_~CRM .cse7 .cse7)) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~lsup~0_9))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|))) (.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~residu~0_9)))) (or (not (= .cse0 .cse1)) (not (= (fp.mul c_~CRM .cse2 .cse3) .cse4)) (not (= .cse5 (fp.mul c_~CRM .cse6 .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7)) (not (= .cse1 .cse3)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse6)) (fp.gt .cse8 .cse4) (not (= .cse8 (fp.mul c_~CRM .cse5 .cse0))) (fp.lt .cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~linf~0_9))))))) is different from true [2020-12-02 14:53:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:53:16,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371197796] [2020-12-02 14:53:16,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:53:16,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-12-02 14:53:16,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899842920] [2020-12-02 14:53:16,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 14:53:16,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:53:16,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 14:53:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56 [2020-12-02 14:53:16,050 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2020-12-02 14:53:18,297 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_SqrtR_~residu~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_9| (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~xn~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_9| (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~linf~0_9 (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~lsup~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_9| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~xn~0_12) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~xn~0_12) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~xn~0_12)))) (let ((.cse2 (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))) (.cse1 (fp.add c_~CRM .cse7 .cse7)) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~lsup~0_9))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|))) (.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~residu~0_9)))) (or (not (= .cse0 .cse1)) (not (= (fp.mul c_~CRM .cse2 .cse3) .cse4)) (not (= .cse5 (fp.mul c_~CRM .cse6 .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7)) (not (= .cse1 .cse3)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse6)) (fp.gt .cse8 .cse4) (not (= .cse8 (fp.mul c_~CRM .cse5 .cse0))) (fp.lt .cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~linf~0_9))))))) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0)))) is different from true [2020-12-02 14:53:20,390 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (= ((_ to_fp 11 53) c_~CRM 1.0) (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xn~0))) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))) (forall ((v_ULTIMATE.start_SqrtR_~residu~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_9| (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~linf~0_9 (_ BitVec 64)) (v_ULTIMATE.start_SqrtR_~lsup~0_9 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~lsup~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~lsup~0_9))) (.cse5 (let ((.cse8 (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xn~0)))) (fp.add c_~CRM .cse8 .cse8))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_9|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_9|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_9|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~residu~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~residu~0_9)))) (or (not (= (fp.mul c_~CRM .cse0 .cse1) .cse2)) (not (= .cse3 (fp.mul c_~CRM .cse4 .cse0))) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse4)) (not (= .cse5 .cse6)) (fp.gt .cse7 .cse2) (not (= .cse5 .cse1)) (not (= .cse7 (fp.mul c_~CRM .cse3 .cse6))) (fp.lt .cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 62 52) v_ULTIMATE.start_SqrtR_~linf~0_9) ((_ extract 51 0) v_ULTIMATE.start_SqrtR_~linf~0_9))))))) is different from true [2020-12-02 14:53:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:53:34,839 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-12-02 14:53:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 14:53:35,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-12-02 14:53:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:53:35,042 INFO L225 Difference]: With dead ends: 47 [2020-12-02 14:53:35,042 INFO L226 Difference]: Without dead ends: 29 [2020-12-02 14:53:35,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=19, Invalid=22, Unknown=5, NotChecked=44, Total=90 [2020-12-02 14:53:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-12-02 14:53:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-12-02 14:53:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-02 14:53:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-12-02 14:53:35,050 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2020-12-02 14:53:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:53:35,050 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-12-02 14:53:35,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 14:53:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-12-02 14:53:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 14:53:35,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:53:35,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:53:35,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 14:53:35,253 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:53:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:53:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -478711233, now seen corresponding path program 1 times [2020-12-02 14:53:35,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:53:35,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73602653] [2020-12-02 14:53:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 14:53:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:53:38,742 WARN L261 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-02 14:53:38,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:53:39,123 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-12-02 14:53:39,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:42,112 WARN L197 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 50 [2020-12-02 14:53:42,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:42,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 14:53:44,158 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= roundNearestTiesToEven c_~CRM)) (.cse6 (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))))) (or (and .cse0 (exists ((ULTIMATE.start_main_~epsilon~0 (_ BitVec 64)) (ULTIMATE.start_main_~d~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet54| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet55| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~d~0) ((_ extract 62 52) ULTIMATE.start_main_~d~0) ((_ extract 51 0) ULTIMATE.start_main_~d~0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~epsilon~0) ((_ extract 62 52) ULTIMATE.start_main_~epsilon~0) ((_ extract 51 0) ULTIMATE.start_main_~epsilon~0))) (.cse2 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet55|))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~dd~0) ((_ extract 62 52) c_ULTIMATE.start_main_~dd~0) ((_ extract 51 0) c_ULTIMATE.start_main_~dd~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet54|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet54|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet54|)))) (and (not (fp.leq .cse1 .cse2)) (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse4 (fp.sub c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= (fp.add c_~CRM .cse5 .cse3) .cse2) (fp.geq .cse1 .cse4)))) (not |c_ULTIMATE.start_main_#t~short56|) .cse6) (and .cse0 .cse6 (exists ((ULTIMATE.start_main_~epsilon~0 (_ BitVec 64)) (ULTIMATE.start_main_~d~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet54| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet55| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) ULTIMATE.start_main_~d~0) ((_ extract 62 52) ULTIMATE.start_main_~d~0) ((_ extract 51 0) ULTIMATE.start_main_~d~0))) (.cse9 (fp ((_ extract 63 63) ULTIMATE.start_main_~epsilon~0) ((_ extract 62 52) ULTIMATE.start_main_~epsilon~0) ((_ extract 51 0) ULTIMATE.start_main_~epsilon~0))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet55|))) (.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~dd~0) ((_ extract 62 52) c_ULTIMATE.start_main_~dd~0) ((_ extract 51 0) c_ULTIMATE.start_main_~dd~0))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet54|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet54|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet54|)))) (and (fp.leq .cse7 .cse8) (= .cse9 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse10 (fp.sub c_~CRM .cse11 .cse9)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse11) (= (fp.add c_~CRM .cse11 .cse9) .cse8) (fp.geq .cse7 .cse10)))) |c_ULTIMATE.start_main_#t~short56|))) is different from false [2020-12-02 14:53:44,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:46,242 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= roundNearestTiesToEven c_~CRM)) (.cse6 (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))))) (or (and .cse0 (exists ((ULTIMATE.start_main_~epsilon~0 (_ BitVec 64)) (ULTIMATE.start_main_~d~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet54| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet55| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~d~0) ((_ extract 62 52) ULTIMATE.start_main_~d~0) ((_ extract 51 0) ULTIMATE.start_main_~d~0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~epsilon~0) ((_ extract 62 52) ULTIMATE.start_main_~epsilon~0) ((_ extract 51 0) ULTIMATE.start_main_~epsilon~0))) (.cse2 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet55|))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~dd~0) ((_ extract 62 52) c_ULTIMATE.start_main_~dd~0) ((_ extract 51 0) c_ULTIMATE.start_main_~dd~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet54|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet54|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet54|)))) (and (not (fp.leq .cse1 .cse2)) (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse4 (fp.sub c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= (fp.add c_~CRM .cse5 .cse3) .cse2) (fp.geq .cse1 .cse4)))) .cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and .cse0 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse6 (exists ((v_prenex_4 (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~dd~0) ((_ extract 62 52) c_ULTIMATE.start_main_~dd~0) ((_ extract 51 0) c_ULTIMATE.start_main_~dd~0))) (.cse11 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse9 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse10 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse8 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (and (fp.geq .cse7 .cse8) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse9) (= .cse10 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse11 (fp.add c_~CRM .cse9 .cse10)) (fp.leq .cse7 .cse11) (= (fp.sub c_~CRM .cse9 .cse10) .cse8))))))) is different from false [2020-12-02 14:53:49,813 WARN L197 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 51 [2020-12-02 14:53:57,176 WARN L197 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 14:53:59,422 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) (fp ((_ extract 63 63) c_~_EPS~0) ((_ extract 62 52) c_~_EPS~0) ((_ extract 51 0) c_~_EPS~0))) (exists ((v_prenex_4 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse5 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse2 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse3 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse4 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse6 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xn~0))) (= .cse2 .cse0) (= .cse2 .cse3) (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (fp.leq .cse1 .cse5) (= .cse5 (fp.add c_~CRM .cse3 .cse4)) (fp.geq .cse1 .cse6) (= .cse2 .cse7) (not (fp.leq .cse1 .cse7)) (= (fp.sub c_~CRM .cse3 .cse4) .cse6))))) is different from false [2020-12-02 14:53:59,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-02 14:53:59,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:53:59,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-02 14:54:02,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0)) (.cse0 (exists ((v_prenex_4 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse29 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse34 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse31 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse30 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse36 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse32 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse33 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse35 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (and (= (fp.div c_~CRM .cse29 .cse30) (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (= .cse31 .cse29) (= .cse31 .cse32) (= .cse33 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (fp.leq .cse30 .cse34) (= .cse34 (fp.add c_~CRM .cse32 .cse33)) (fp.geq .cse30 .cse35) (= .cse31 .cse36) (not (fp.leq .cse30 .cse36)) (= (fp.sub c_~CRM .cse32 .cse33) .cse35))))) (.cse9 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 (exists ((ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~linf~0 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (~_EPS~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse2 (let ((.cse8 (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0)))) (fp.add c_~CRM .cse8 .cse8))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse3 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0)))) (and (= .cse1 .cse2) (= (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0)) (fp.mul c_~CRM .cse3 .cse4)) (= .cse5 (fp.mul c_~CRM .cse6 .cse1)) (= .cse7 ((_ to_fp 11 53) c_~CRM 2.0)) (= .cse4 .cse2) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) .cse3) (= .cse6 (fp.mul c_~CRM .cse7 .cse3)) (fp.lt .cse5 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~linf~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~linf~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~linf~0)))))) .cse9 .cse10) (and .cse0 .cse9 (exists ((ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (~_EPS~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse16 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse13 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse12 (let ((.cse19 (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0)))) (fp.add c_~CRM .cse19 .cse19))) (.cse17 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse14 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0)))) (and (= .cse11 .cse12) (= .cse13 (fp.mul c_~CRM .cse14 .cse15)) (= .cse16 (fp.mul c_~CRM .cse17 .cse11)) (= .cse18 ((_ to_fp 11 53) c_~CRM 2.0)) (fp.gt .cse16 .cse13) (= .cse15 .cse12) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) .cse14) (= .cse17 (fp.mul c_~CRM .cse18 .cse14))))) .cse10) (and .cse0 (exists ((ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (~_EPS~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64))) (let ((.cse21 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse20 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse22 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse25 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse23 (let ((.cse28 (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0)))) (fp.add c_~CRM .cse28 .cse28))) (.cse26 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse27 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse24 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0)))) (and (not (fp.gt .cse20 .cse21)) (not (fp.lt .cse20 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= .cse22 .cse23) (= .cse21 (fp.mul c_~CRM .cse24 .cse25)) (= .cse20 (fp.mul c_~CRM .cse26 .cse22)) (= .cse27 ((_ to_fp 11 53) c_~CRM 2.0)) (= .cse25 .cse23) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) .cse24) (= .cse26 (fp.mul c_~CRM .cse27 .cse24))))) .cse9 (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0)))) is different from false [2020-12-02 14:54:04,827 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_4 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse5 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse2 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse3 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse4 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse6 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (= .cse2 .cse0) (= .cse2 .cse3) (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (fp.leq .cse1 .cse5) (= .cse5 (fp.add c_~CRM .cse3 .cse4)) (fp.geq .cse1 .cse6) (= .cse2 .cse7) (not (fp.leq .cse1 .cse7)) (= (fp.sub c_~CRM .cse3 .cse4) .cse6)))) (exists ((ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (~_EPS~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse13 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse11 (let ((.cse16 (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0)))) (fp.add c_~CRM .cse16 .cse16))) (.cse14 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse12 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0)))) (and (not (fp.gt .cse8 .cse9)) (not (fp.lt .cse8 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= .cse10 .cse11) (= .cse9 (fp.mul c_~CRM .cse12 .cse13)) (= .cse8 (fp.mul c_~CRM .cse14 .cse10)) (= .cse15 ((_ to_fp 11 53) c_~CRM 2.0)) (= .cse13 .cse11) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) .cse12) (= .cse14 (fp.mul c_~CRM .cse15 .cse12))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 14:54:07,425 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_11| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (~_EPS~0 (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse13 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse12 (fp.add c_~CRM .cse14 .cse14)) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse4 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0))) (.cse11 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse10 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse1 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse16 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse8 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse17 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (and (not (fp.lt .cse0 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= .cse1 .cse2) (= .cse3 (fp.mul c_~CRM .cse4 .cse5)) (= .cse0 (fp.mul c_~CRM .cse6 .cse7)) (= .cse8 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse9 ((_ to_fp 11 53) c_~CRM 2.0)) (fp.leq .cse10 .cse11) (= .cse5 .cse12) (= (fp ((_ extract 63 63) |c_ULTIMATE.start_SqrtR_#res|) ((_ extract 62 52) |c_ULTIMATE.start_SqrtR_#res|) ((_ extract 51 0) |c_ULTIMATE.start_SqrtR_#res|)) (fp.div c_~CRM .cse13 .cse14)) (= .cse1 .cse13) (not (fp.leq .cse10 .cse15)) (not (fp.gt .cse0 .cse3)) (= (fp.div c_~CRM .cse2 .cse10) .cse14) (= .cse7 .cse12) (= .cse1 .cse16) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) .cse4) (= .cse6 (fp.mul c_~CRM .cse9 .cse4)) (= .cse11 (fp.add c_~CRM .cse16 .cse8)) (fp.geq .cse10 .cse17) (= .cse1 .cse15) (= (fp.sub c_~CRM .cse16 .cse8) .cse17))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 14:54:10,054 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_11| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (~_EPS~0 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse14 (fp.add c_~CRM .cse2 .cse2)) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse11 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse6 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0))) (.cse13 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse12 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse3 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse16 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse10 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse17 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (and (not (fp.lt .cse0 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~r~0) ((_ extract 62 52) c_ULTIMATE.start_main_~r~0) ((_ extract 51 0) c_ULTIMATE.start_main_~r~0)) (fp.div c_~CRM .cse1 .cse2)) (= .cse3 .cse4) (= .cse5 (fp.mul c_~CRM .cse6 .cse7)) (= .cse0 (fp.mul c_~CRM .cse8 .cse9)) (= .cse10 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse11 ((_ to_fp 11 53) c_~CRM 2.0)) (fp.leq .cse12 .cse13) (= .cse7 .cse14) (= .cse3 .cse1) (not (fp.leq .cse12 .cse15)) (not (fp.gt .cse0 .cse5)) (= (fp.div c_~CRM .cse4 .cse12) .cse2) (= .cse9 .cse14) (= .cse3 .cse16) (= ((_ to_fp 11 53) c_~CRM (/ 1.0 1000000.0)) .cse6) (= .cse8 (fp.mul c_~CRM .cse11 .cse6)) (= .cse13 (fp.add c_~CRM .cse16 .cse10)) (fp.geq .cse12 .cse17) (= .cse3 .cse15) (= (fp.sub c_~CRM .cse16 .cse10) .cse17)))))) is different from false [2020-12-02 14:54:10,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:54:10,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:54:10,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 23 disjuncts [2020-12-02 14:54:22,541 WARN L838 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short60|) (exists ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_11| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (~_EPS~0 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse2 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse16 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse11 (fp.add roundNearestTiesToEven .cse13 .cse13)) (.cse15 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse18 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0))) (.cse19 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse9 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse17 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|))) (.cse14 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0)))) (and (= .cse0 (fp.add roundNearestTiesToEven .cse1 .cse2)) (not (fp.lt .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= .cse4 .cse5) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)) .cse2) (= .cse4 .cse6) (fp.leq .cse7 .cse0) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse8) (= (fp.sub roundNearestTiesToEven .cse1 .cse2) .cse9) (= .cse10 .cse11) (= (fp.div roundNearestTiesToEven .cse12 .cse7) .cse13) (not (fp.leq .cse14 .cse8)) (not (fp.leq .cse7 .cse6)) (= .cse4 .cse12) (not (fp.gt .cse3 .cse15)) (= .cse16 (fp.mul roundNearestTiesToEven .cse17 .cse18)) (= .cse3 (fp.mul roundNearestTiesToEven .cse16 .cse10)) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) .cse18) (= .cse4 .cse1) (= .cse19 .cse11) (= .cse15 (fp.mul roundNearestTiesToEven .cse18 .cse19)) (fp.geq .cse7 .cse9) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse17) (= (fp.div roundNearestTiesToEven .cse5 .cse13) .cse14)))))) (and |c_ULTIMATE.start_main_#t~short60| (exists ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_11| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (~_EPS~0 (_ BitVec 64))) (let ((.cse33 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse20 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse22 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse28 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse26 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse32 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse23 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse36 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse30 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse24 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse21 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse31 (fp.add roundNearestTiesToEven .cse33 .cse33)) (.cse35 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse38 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0))) (.cse39 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse27 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse29 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse37 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse25 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|))) (.cse34 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0)))) (and (= .cse20 (fp.add roundNearestTiesToEven .cse21 .cse22)) (not (fp.lt .cse23 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= .cse24 .cse25) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)) .cse22) (= .cse24 .cse26) (fp.leq .cse27 .cse20) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse28) (= (fp.sub roundNearestTiesToEven .cse21 .cse22) .cse29) (= .cse30 .cse31) (= (fp.div roundNearestTiesToEven .cse32 .cse27) .cse33) (fp.leq .cse34 .cse28) (not (fp.leq .cse27 .cse26)) (= .cse24 .cse32) (not (fp.gt .cse23 .cse35)) (= .cse36 (fp.mul roundNearestTiesToEven .cse37 .cse38)) (= .cse23 (fp.mul roundNearestTiesToEven .cse36 .cse30)) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) .cse38) (= .cse24 .cse21) (= .cse39 .cse31) (= .cse35 (fp.mul roundNearestTiesToEven .cse38 .cse39)) (fp.geq .cse27 .cse29) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse37) (= (fp.div roundNearestTiesToEven .cse25 .cse33) .cse34))))))) is different from false [2020-12-02 14:54:24,852 WARN L860 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short60|) (exists ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_11| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (~_EPS~0 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse2 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse16 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse11 (fp.add roundNearestTiesToEven .cse13 .cse13)) (.cse15 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse18 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0))) (.cse19 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse9 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse17 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|))) (.cse14 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0)))) (and (= .cse0 (fp.add roundNearestTiesToEven .cse1 .cse2)) (not (fp.lt .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= .cse4 .cse5) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)) .cse2) (= .cse4 .cse6) (fp.leq .cse7 .cse0) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse8) (= (fp.sub roundNearestTiesToEven .cse1 .cse2) .cse9) (= .cse10 .cse11) (= (fp.div roundNearestTiesToEven .cse12 .cse7) .cse13) (not (fp.leq .cse14 .cse8)) (not (fp.leq .cse7 .cse6)) (= .cse4 .cse12) (not (fp.gt .cse3 .cse15)) (= .cse16 (fp.mul roundNearestTiesToEven .cse17 .cse18)) (= .cse3 (fp.mul roundNearestTiesToEven .cse16 .cse10)) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) .cse18) (= .cse4 .cse1) (= .cse19 .cse11) (= .cse15 (fp.mul roundNearestTiesToEven .cse18 .cse19)) (fp.geq .cse7 .cse9) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse17) (= (fp.div roundNearestTiesToEven .cse5 .cse13) .cse14)))))) (and |c_ULTIMATE.start_main_#t~short60| (exists ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet16_12| (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_13| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~residu~0 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet14_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet12_12| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet13_12| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~lsup~0 (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_11| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet10_8| (_ BitVec 64)) (~_EPS~0 (_ BitVec 64))) (let ((.cse33 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse20 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse22 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse28 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse26 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_13|))) (.cse32 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_8|))) (.cse23 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~residu~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~residu~0))) (.cse36 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet13_12|))) (.cse30 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet14_12|))) (.cse24 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse21 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse31 (fp.add roundNearestTiesToEven .cse33 .cse33)) (.cse35 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~lsup~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~lsup~0))) (.cse38 (fp ((_ extract 63 63) ~_EPS~0) ((_ extract 62 52) ~_EPS~0) ((_ extract 51 0) ~_EPS~0))) (.cse39 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet16_12|))) (.cse27 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse29 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse37 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_12|))) (.cse25 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_11|))) (.cse34 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0)))) (and (= .cse20 (fp.add roundNearestTiesToEven .cse21 .cse22)) (not (fp.lt .cse23 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (= .cse24 .cse25) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)) .cse22) (= .cse24 .cse26) (fp.leq .cse27 .cse20) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse28) (= (fp.sub roundNearestTiesToEven .cse21 .cse22) .cse29) (= .cse30 .cse31) (= (fp.div roundNearestTiesToEven .cse32 .cse27) .cse33) (fp.leq .cse34 .cse28) (not (fp.leq .cse27 .cse26)) (= .cse24 .cse32) (not (fp.gt .cse23 .cse35)) (= .cse36 (fp.mul roundNearestTiesToEven .cse37 .cse38)) (= .cse23 (fp.mul roundNearestTiesToEven .cse36 .cse30)) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) .cse38) (= .cse24 .cse21) (= .cse39 .cse31) (= .cse35 (fp.mul roundNearestTiesToEven .cse38 .cse39)) (fp.geq .cse27 .cse29) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse37) (= (fp.div roundNearestTiesToEven .cse25 .cse33) .cse34))))))) is different from true [2020-12-02 14:54:24,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:54:27,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73602653] [2020-12-02 14:54:27,482 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-12-02 14:54:27,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [40312652] [2020-12-02 14:54:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-12-02 14:54:27,501 WARN L195 Executor]: External (cvc4 --incremental --print-success --lang smt --rewrite-divk) stderr output: (error "Error in option parsing: can't understand option `--rewrite-divk'") Please use --help [2020-12-02 14:54:27,503 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (cvc4 --incremental --print-success --lang smt --rewrite-divk)Received EOF on stdin. stderr output: (error "Error in option parsing: can't understand option `--rewrite-divk'") Please use --help at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.createProcess(Executor.java:108) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.(Executor.java:83) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.(Scriptor.java:72) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.solverbuilder.SolverBuilder.buildScript(SolverBuilder.java:149) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.solverbuilder.SolverBuilder.buildAndInitializeSolver(SolverBuilder.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 34 more [2020-12-02 14:54:27,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313741408] [2020-12-02 14:54:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-02 15:00:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:00:37,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-02 15:00:37,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:00:37,250 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 3 [2020-12-02 15:00:38,684 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-02 15:00:42,183 WARN L197 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-12-02 15:00:42,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:00:42,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 15:00:44,221 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= roundNearestTiesToEven c_~CRM)) (.cse4 (exists ((v_prenex_6 (_ BitVec 64))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~dd~0) ((_ extract 62 52) c_ULTIMATE.start_main_~dd~0) ((_ extract 51 0) c_ULTIMATE.start_main_~dd~0)) (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)))))) (or (and (exists ((ULTIMATE.start_main_~epsilon~0 (_ BitVec 64)) (ULTIMATE.start_main_~d~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet55| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~d~0) ((_ extract 62 52) ULTIMATE.start_main_~d~0) ((_ extract 51 0) ULTIMATE.start_main_~d~0))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~epsilon~0) ((_ extract 62 52) ULTIMATE.start_main_~epsilon~0) ((_ extract 51 0) ULTIMATE.start_main_~epsilon~0))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet55|)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~dd~0) ((_ extract 62 52) c_ULTIMATE.start_main_~dd~0) ((_ extract 51 0) c_ULTIMATE.start_main_~dd~0)) .cse0) (= .cse1 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= (fp.add c_~CRM .cse2 .cse1) .cse0)))) .cse3 .cse4 |c_ULTIMATE.start_main_#t~short56|) (and .cse3 .cse4 (not |c_ULTIMATE.start_main_#t~short56|) (exists ((ULTIMATE.start_main_~epsilon~0 (_ BitVec 64)) (ULTIMATE.start_main_~d~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet55| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~d~0) ((_ extract 62 52) ULTIMATE.start_main_~d~0) ((_ extract 51 0) ULTIMATE.start_main_~d~0))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~epsilon~0) ((_ extract 62 52) ULTIMATE.start_main_~epsilon~0) ((_ extract 51 0) ULTIMATE.start_main_~epsilon~0))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet55|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet55|)))) (and (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~dd~0) ((_ extract 62 52) c_ULTIMATE.start_main_~dd~0) ((_ extract 51 0) c_ULTIMATE.start_main_~dd~0)) .cse5)) (= .cse6 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7) (= (fp.add c_~CRM .cse7 .cse6) .cse5))))))) is different from false [2020-12-02 15:00:44,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:01:15,163 WARN L197 SmtUtils]: Spent 10.76 s on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2020-12-02 15:01:22,669 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 35 [2020-12-02 15:01:30,527 WARN L197 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 41 [2020-12-02 15:01:32,785 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse5 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse6 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse0 .cse1) (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xn~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xn~0))) (= .cse0 .cse2) (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse5 .cse0) (not (fp.leq .cse3 .cse1)) (= (fp.add c_~CRM .cse5 .cse4) .cse6) (fp.leq .cse3 .cse6))))) is different from false [2020-12-02 15:01:35,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet12_13| (_ BitVec 64))) (= ((_ to_fp 11 53) c_~CRM 2.0) (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|))))) (.cse1 (= roundNearestTiesToEven c_~CRM)) (.cse2 (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse3 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse7 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse6 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse9 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse3 .cse4) (= .cse3 .cse5) (= .cse6 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse7 .cse3) (= (fp.div c_~CRM .cse5 .cse8) (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (not (fp.leq .cse8 .cse4)) (= (fp.add c_~CRM .cse7 .cse6) .cse9) (fp.leq .cse8 .cse9)))))) (or (and .cse0 .cse1 .cse2 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0)) (and .cse0 .cse1 .cse2 (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0)))) is different from false [2020-12-02 15:01:37,490 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet12_13| (_ BitVec 64))) (= ((_ to_fp 11 53) c_~CRM 2.0) (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|)))) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse4 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse3 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse6 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse0 .cse1) (= .cse0 .cse2) (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse4 .cse0) (= (fp.div c_~CRM .cse2 .cse5) (fp ((_ extract 63 63) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) c_ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (not (fp.leq .cse5 .cse1)) (= (fp.add c_~CRM .cse4 .cse3) .cse6) (fp.leq .cse5 .cse6))))) is different from false [2020-12-02 15:01:40,055 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet12_13| (_ BitVec 64))) (= ((_ to_fp 11 53) c_~CRM 2.0) (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|)))) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse5 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse8 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse0 .cse1) (= .cse0 .cse2) (= .cse0 .cse3) (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse5 .cse0) (= (fp.div c_~CRM .cse2 .cse6) (fp ((_ extract 63 63) |c_ULTIMATE.start_SqrtR_#res|) ((_ extract 62 52) |c_ULTIMATE.start_SqrtR_#res|) ((_ extract 51 0) |c_ULTIMATE.start_SqrtR_#res|))) (= (fp.div c_~CRM .cse3 .cse7) .cse6) (not (fp.leq .cse7 .cse1)) (= (fp.add c_~CRM .cse5 .cse4) .cse8) (fp.leq .cse7 .cse8))))) is different from false [2020-12-02 15:01:42,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet12_13| (_ BitVec 64))) (= ((_ to_fp 11 53) c_~CRM 2.0) (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet12_13|))))) (.cse1 (= roundNearestTiesToEven c_~CRM)) (.cse2 (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|))) (.cse3 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse9 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse8 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse10 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse11 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse3 .cse4) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~r~0) ((_ extract 62 52) c_ULTIMATE.start_main_~r~0) ((_ extract 51 0) c_ULTIMATE.start_main_~r~0)) (fp.div c_~CRM .cse5 .cse6)) (= .cse3 .cse5) (= .cse3 .cse7) (= .cse8 ((_ to_fp 11 53) c_~CRM (/ 1.0 100000000.0))) (= .cse9 .cse3) (= (fp.div c_~CRM .cse7 .cse10) .cse6) (not (fp.leq .cse10 .cse4)) (= (fp.add c_~CRM .cse9 .cse8) .cse11) (fp.leq .cse10 .cse11)))))) (or (and .cse0 .cse1 .cse2 (not |c_ULTIMATE.start_main_#t~short60|) (exists ((|ULTIMATE.start_main_#t~nondet58| (_ BitVec 64))) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~r~0) ((_ extract 62 52) c_ULTIMATE.start_main_~r~0) ((_ extract 51 0) c_ULTIMATE.start_main_~r~0)) (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet58|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet58|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet58|)))))) (and .cse0 |c_ULTIMATE.start_main_#t~short60| .cse1 .cse2 (exists ((v_prenex_11 (_ BitVec 64))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~r~0) ((_ extract 62 52) c_ULTIMATE.start_main_~r~0) ((_ extract 51 0) c_ULTIMATE.start_main_~r~0)) (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))))))) is different from false [2020-12-02 15:01:42,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:01:42,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 15:01:42,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-02 15:01:55,466 WARN L838 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short60|) (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse1 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0))) (.cse2 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (= .cse1 (fp.add roundNearestTiesToEven .cse2 .cse0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.leq .cse6 .cse3)) (fp.leq .cse4 .cse1) (= (fp.div roundNearestTiesToEven .cse7 .cse8) .cse6) (fp.geq .cse6 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= .cse9 .cse10) (= .cse2 .cse9) (= .cse9 .cse5) (= .cse9 .cse7) (= (fp.div roundNearestTiesToEven .cse10 .cse4) .cse8))))) (and (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse14 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse12 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse17 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0))) (.cse13 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse16 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse20 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|))) (.cse21 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse15 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse19 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (and (= .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (= .cse12 (fp.add roundNearestTiesToEven .cse13 .cse11)) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse14) (not (fp.leq .cse15 .cse16)) (fp.leq .cse17 .cse14) (fp.leq .cse15 .cse12) (= (fp.div roundNearestTiesToEven .cse18 .cse19) .cse17) (fp.geq .cse17 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= .cse20 .cse21) (= .cse13 .cse20) (= .cse20 .cse16) (= .cse20 .cse18) (= (fp.div roundNearestTiesToEven .cse21 .cse15) .cse19)))) |c_ULTIMATE.start_main_#t~short60|)) is different from false [2020-12-02 15:01:57,813 WARN L860 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short60|) (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse1 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0))) (.cse2 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (= .cse1 (fp.add roundNearestTiesToEven .cse2 .cse0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.leq .cse6 .cse3)) (fp.leq .cse4 .cse1) (= (fp.div roundNearestTiesToEven .cse7 .cse8) .cse6) (fp.geq .cse6 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= .cse9 .cse10) (= .cse2 .cse9) (= .cse9 .cse5) (= .cse9 .cse7) (= (fp.div roundNearestTiesToEven .cse10 .cse4) .cse8))))) (and (exists ((|v_ULTIMATE.start_SqrtR_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet45_12| (_ BitVec 64)) (ULTIMATE.start_SqrtR_~Input (_ BitVec 64)) (|v_ULTIMATE.start_SqrtR_#t~nondet8_14| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (ULTIMATE.start_main_~r~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_SqrtR_~xnp1~0 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet59| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse14 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet59|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet59|))) (.cse12 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse17 (fp ((_ extract 63 63) ULTIMATE.start_main_~r~0) ((_ extract 62 52) ULTIMATE.start_main_~r~0) ((_ extract 51 0) ULTIMATE.start_main_~r~0))) (.cse13 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse16 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet8_14|))) (.cse20 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet45_12|))) (.cse21 (fp ((_ extract 63 63) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_SqrtR_#t~nondet10_9|))) (.cse15 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~Input) ((_ extract 62 52) ULTIMATE.start_SqrtR_~Input) ((_ extract 51 0) ULTIMATE.start_SqrtR_~Input))) (.cse19 (fp ((_ extract 63 63) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 62 52) ULTIMATE.start_SqrtR_~xnp1~0) ((_ extract 51 0) ULTIMATE.start_SqrtR_~xnp1~0)))) (and (= .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (= .cse12 (fp.add roundNearestTiesToEven .cse13 .cse11)) (= ((_ to_fp 11 53) roundNearestTiesToEven 5.0) .cse14) (not (fp.leq .cse15 .cse16)) (fp.leq .cse17 .cse14) (fp.leq .cse15 .cse12) (= (fp.div roundNearestTiesToEven .cse18 .cse19) .cse17) (fp.geq .cse17 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= .cse20 .cse21) (= .cse13 .cse20) (= .cse20 .cse16) (= .cse20 .cse18) (= (fp.div roundNearestTiesToEven .cse21 .cse15) .cse19)))) |c_ULTIMATE.start_main_#t~short60|)) is different from true [2020-12-02 15:01:57,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:02:00,352 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-12-02 15:02:00,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:02:00,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-02 15:02:00,353 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-12-02 15:02:00,353 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2020-12-02 15:02:00,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-02 15:02:00,786 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-02 15:02:00,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:02:00 BoogieIcfgContainer [2020-12-02 15:02:00,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 15:02:00,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 15:02:00,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 15:02:00,791 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 15:02:00,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:00" (3/4) ... [2020-12-02 15:02:00,796 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 15:02:00,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 15:02:00,799 INFO L168 Benchmark]: Toolchain (without parser) took 551369.34 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 24.0 MB in the beginning and 26.0 MB in the end (delta: -2.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-12-02 15:02:00,800 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 48.2 MB. Free memory was 27.8 MB in the beginning and 27.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:02:00,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.05 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 23.8 MB in the beginning and 39.1 MB in the end (delta: -15.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-12-02 15:02:00,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.67 ms. Allocated memory is still 65.0 MB. Free memory was 39.1 MB in the beginning and 36.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 15:02:00,807 INFO L168 Benchmark]: Boogie Preprocessor took 60.89 ms. Allocated memory is still 65.0 MB. Free memory was 36.7 MB in the beginning and 48.4 MB in the end (delta: -11.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-12-02 15:02:00,808 INFO L168 Benchmark]: RCFGBuilder took 10618.29 ms. Allocated memory is still 65.0 MB. Free memory was 48.4 MB in the beginning and 34.6 MB in the end (delta: 13.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-02 15:02:00,809 INFO L168 Benchmark]: TraceAbstraction took 540033.55 ms. Allocated memory is still 65.0 MB. Free memory was 34.0 MB in the beginning and 26.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-02 15:02:00,810 INFO L168 Benchmark]: Witness Printer took 9.44 ms. Allocated memory is still 65.0 MB. Free memory is still 26.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:02:00,814 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 48.2 MB. Free memory was 27.8 MB in the beginning and 27.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 573.05 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 23.8 MB in the beginning and 39.1 MB in the end (delta: -15.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.67 ms. Allocated memory is still 65.0 MB. Free memory was 39.1 MB in the beginning and 36.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.89 ms. Allocated memory is still 65.0 MB. Free memory was 36.7 MB in the beginning and 48.4 MB in the end (delta: -11.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10618.29 ms. Allocated memory is still 65.0 MB. Free memory was 48.4 MB in the beginning and 34.6 MB in the end (delta: 13.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 540033.55 ms. Allocated memory is still 65.0 MB. Free memory was 34.0 MB in the beginning and 26.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Witness Printer took 9.44 ms. Allocated memory is still 65.0 MB. Free memory is still 26.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L15] EXPR 1e-6 [L15] double _EPS = 1e-6; [L15] 1e-6 [L43] double d, dd, r; [L44] EXPR 1e-8 [L44] double epsilon = 1e-8; [L46] EXPR 1. [L46] d = 1. [L46] EXPR 20. [L46] COND TRUE d <= 20. [L48] dd = __VERIFIER_nondet_double() [L49] EXPR d-epsilon [L49] dd >= d-epsilon && dd <= d+epsilon [L49] EXPR d+epsilon [L49] dd >= d-epsilon && dd <= d+epsilon [L11] COND FALSE !(!cond) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; [L21] EXPR 1.0 [L21] COND FALSE !(Input <= 1.0) [L21] EXPR 1.0 [L21] EXPR 1.0/Input [L21] xn = 1.0/Input [L22] xnp1 = xn [L23] EXPR 2.0 [L23] EXPR 2.0*_EPS [L23] EXPR xn+xnp1 [L23] EXPR 2.0*_EPS*(xn+xnp1) [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] EXPR xn+xnp1 [L24] EXPR _EPS * (xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] EXPR -lsup [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 [L28] COND FALSE !(\read(cond)) [L38] EXPR 1.0 [L38] EXPR 1.0 / xnp1 [L38] return 1.0 / xnp1; [L51] r = SqrtR(dd) [L53] EXPR 0.9 [L53] r >= 0.9 && r <= 5. [L53] EXPR 5. [L53] r >= 0.9 && r <= 5. [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 539.9s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 72 SDtfs, 1 SDslu, 67 SDs, 0 SdLazy, 19 SolverSat, 0 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 9 QuantifiedInterpolants, 29632 SizeOfPredicates, 9 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...