./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0730b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0730b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 788527977e7ebd7aa0a832758f41b65d3cbd270a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0730b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 788527977e7ebd7aa0a832758f41b65d3cbd270a ........................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:51:27,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:51:27,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:51:27,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:51:27,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:51:27,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:51:27,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:51:27,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:51:27,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:51:27,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:51:27,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:51:27,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:51:27,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:51:27,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:51:27,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:51:27,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:51:27,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:51:27,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:51:27,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:51:27,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:51:27,744 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:51:27,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:51:27,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:51:27,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:51:27,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:51:27,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:51:27,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:51:27,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:51:27,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:51:27,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:51:27,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:51:27,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:51:27,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:51:27,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:51:27,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:51:27,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:51:27,752 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 02:51:27,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:51:27,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:51:27,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:51:27,764 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:51:27,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:51:27,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:51:27,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:51:27,765 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:51:27,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:51:27,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:51:27,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:51:27,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:51:27,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:51:27,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:51:27,766 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:51:27,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:51:27,766 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:51:27,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:51:27,766 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:51:27,766 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:51:27,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:51:27,767 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:51:27,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:51:27,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:51:27,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:51:27,767 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:51:27,767 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 02:51:27,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:51:27,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:51:27,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 788527977e7ebd7aa0a832758f41b65d3cbd270a [2018-11-23 02:51:27,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:51:27,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:51:27,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:51:27,804 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:51:27,804 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:51:27,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-11-23 02:51:27,847 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/ed605c866/8da1d2ce39e84b8ebfb83f4fb429ad84/FLAG1bc5a491a [2018-11-23 02:51:28,249 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:51:28,250 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/sv-benchmarks/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-11-23 02:51:28,254 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/ed605c866/8da1d2ce39e84b8ebfb83f4fb429ad84/FLAG1bc5a491a [2018-11-23 02:51:28,262 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/ed605c866/8da1d2ce39e84b8ebfb83f4fb429ad84 [2018-11-23 02:51:28,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:51:28,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:51:28,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:51:28,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:51:28,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:51:28,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a16ae76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28, skipping insertion in model container [2018-11-23 02:51:28,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:51:28,292 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:51:28,429 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:51:28,431 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:51:28,460 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:51:28,512 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:51:28,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28 WrapperNode [2018-11-23 02:51:28,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:51:28,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:51:28,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:51:28,513 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:51:28,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:51:28,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:51:28,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:51:28,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:51:28,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... [2018-11-23 02:51:28,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:51:28,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:51:28,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:51:28,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:51:28,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 02:51:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 02:51:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:51:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:51:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:51:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:51:28,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:51:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:51:28,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:51:29,202 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:51:29,202 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 02:51:29,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:29 BoogieIcfgContainer [2018-11-23 02:51:29,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:51:29,203 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:51:29,203 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:51:29,210 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:51:29,210 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:29" (1/1) ... [2018-11-23 02:51:29,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:51:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 27 states and 43 transitions. [2018-11-23 02:51:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2018-11-23 02:51:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 02:51:29,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2018-11-23 02:51:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2018-11-23 02:51:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 02:51:29,315 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:51:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:51:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:51:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:51:29,398 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-300;havoc main_#res;havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0;main_~x~0 := ~someUnaryDOUBLEoperation(0.0);__ieee754_sqrt_#in~x := main_~x~0;havoc __ieee754_sqrt_#res;havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6.lsw, __ieee754_sqrt_#t~union6.msw, __ieee754_sqrt_~#iw_u~0.base, __ieee754_sqrt_~#iw_u~0.offset, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0;__ieee754_sqrt_~x := __ieee754_sqrt_#in~x;havoc __ieee754_sqrt_~z~0;__ieee754_sqrt_~sign~0 := -2147483648;havoc __ieee754_sqrt_~r~0;havoc __ieee754_sqrt_~t1~0;havoc __ieee754_sqrt_~s1~0;havoc __ieee754_sqrt_~ix1~0;havoc __ieee754_sqrt_~q1~0;havoc __ieee754_sqrt_~ix0~0;havoc __ieee754_sqrt_~s0~0;havoc __ieee754_sqrt_~q~0;havoc __ieee754_sqrt_~m~0;havoc __ieee754_sqrt_~t~0;havoc __ieee754_sqrt_~i~0; VAL [ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] call __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(__ieee754_sqrt_~x, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8);call __ieee754_sqrt_#t~mem0 := read~int(__ieee754_sqrt_~#ew_u~0.base, 4 + __ieee754_sqrt_~#ew_u~0.offset, 4);__ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(__ieee754_sqrt_#t~union1, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8);havoc __ieee754_sqrt_#t~mem0;havoc __ieee754_sqrt_#t~union1;call __ieee754_sqrt_#t~mem2 := read~int(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 4);__ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2;call write~real(__ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8);havoc __ieee754_sqrt_#t~union3;havoc __ieee754_sqrt_#t~mem2;call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset);havoc __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=1391, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] goto; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=1391, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072);__ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=1391, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] main_#t~ret9 := __ieee754_sqrt_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9;main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=1391, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, |ULTIMATE.start_main_#t~short11|=false, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume !main_#t~short11; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=1391, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, |ULTIMATE.start_main_#t~short11|=false, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume !main_#t~short11;havoc main_#t~ret10;havoc main_#t~short11; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=1391, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume !false; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=1391, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6.lsw, __ieee754_sqrt_#t~union6.msw, __ieee754_sqrt_~#iw_u~0.base, __ieee754_sqrt_~#iw_u~0.offset, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] call __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset := #Ultimate.alloc(8); [L27] call write~real(__ieee754_sqrt_~x, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] call __ieee754_sqrt_#t~mem0 := read~int(__ieee754_sqrt_~#ew_u~0.base, 4 + __ieee754_sqrt_~#ew_u~0.offset, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] call write~real(__ieee754_sqrt_#t~union1, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] call __ieee754_sqrt_#t~mem2 := read~int(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] call write~real(__ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset); [L26] havoc __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32-L34] assume 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072); [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153-L156] assume !main_#t~short11; [L153] havoc main_#t~ret10; [L153] havoc main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6.lsw, __ieee754_sqrt_#t~union6.msw, __ieee754_sqrt_~#iw_u~0.base, __ieee754_sqrt_~#iw_u~0.offset, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] call __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset := #Ultimate.alloc(8); [L27] call write~real(__ieee754_sqrt_~x, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] call __ieee754_sqrt_#t~mem0 := read~int(__ieee754_sqrt_~#ew_u~0.base, 4 + __ieee754_sqrt_~#ew_u~0.offset, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] call write~real(__ieee754_sqrt_#t~union1, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] call __ieee754_sqrt_#t~mem2 := read~int(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] call write~real(__ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset); [L26] havoc __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32-L34] assume 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072); [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153-L156] assume !main_#t~short11; [L153] havoc main_#t~ret10; [L153] havoc main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6, __ieee754_sqrt_~#iw_u~0, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call __ieee754_sqrt_~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(__ieee754_sqrt_~x, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] FCALL call __ieee754_sqrt_#t~mem0 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: 4 + __ieee754_sqrt_~#ew_u~0!offset }, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(__ieee754_sqrt_#t~union1, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] FCALL call __ieee754_sqrt_#t~mem2 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] FCALL call write~real(__ieee754_sqrt_#t~union3, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] FCALL call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0); [L26] havoc __ieee754_sqrt_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072) [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !main_#t~short11 [L153] havoc main_#t~ret10; [L153] havoc main_#t~short11; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6, __ieee754_sqrt_~#iw_u~0, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call __ieee754_sqrt_~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(__ieee754_sqrt_~x, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] FCALL call __ieee754_sqrt_#t~mem0 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: 4 + __ieee754_sqrt_~#ew_u~0!offset }, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(__ieee754_sqrt_#t~union1, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] FCALL call __ieee754_sqrt_#t~mem2 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] FCALL call write~real(__ieee754_sqrt_#t~union3, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] FCALL call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0); [L26] havoc __ieee754_sqrt_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072) [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !main_#t~short11 [L153] havoc main_#t~ret10; [L153] havoc main_#t~short11; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=1391, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [L149] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L19-L127] ~x := #in~x; [L20] havoc ~z~0; [L21] ~sign~0 := -2147483648; [L22] havoc ~r~0; [L22] havoc ~t1~0; [L22] havoc ~s1~0; [L22] havoc ~ix1~0; [L22] havoc ~q1~0; [L23] havoc ~ix0~0; [L23] havoc ~s0~0; [L23] havoc ~q~0; [L23] havoc ~m~0; [L23] havoc ~t~0; [L23] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L28] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] havoc #t~mem0; [L28] havoc #t~union1; [L29] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L29] ~ix1~0 := #t~mem2; [L29] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union3; [L29] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L26] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L33] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] ~res~0 := #t~ret9; [L150] havoc #t~ret9; [L153] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !#t~short11 [L153] havoc #t~ret10; [L153] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [L149] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L19-L127] ~x := #in~x; [L20] havoc ~z~0; [L21] ~sign~0 := -2147483648; [L22] havoc ~r~0; [L22] havoc ~t1~0; [L22] havoc ~s1~0; [L22] havoc ~ix1~0; [L22] havoc ~q1~0; [L23] havoc ~ix0~0; [L23] havoc ~s0~0; [L23] havoc ~q~0; [L23] havoc ~m~0; [L23] havoc ~t~0; [L23] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L28] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] havoc #t~mem0; [L28] havoc #t~union1; [L29] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L29] ~ix1~0 := #t~mem2; [L29] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union3; [L29] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L26] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L33] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] ~res~0 := #t~ret9; [L150] havoc #t~ret9; [L153] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !#t~short11 [L153] havoc #t~ret10; [L153] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L149] double x = -0.0; [L20] double z; [L21] __int32_t sign = 0x80000000; [L22] __uint32_t r, t1, s1, ix1, q1; [L23] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] ieee_double_shape_type ew_u; [L27] ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] (ix0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] (ix1) = ew_u.parts.lsw [L32] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L33] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_sqrt(x); [L153] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L154] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- [2018-11-23 02:51:29,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:51:29 ImpRootNode [2018-11-23 02:51:29,438 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:51:29,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:51:29,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:51:29,438 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:51:29,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:29" (3/4) ... [2018-11-23 02:51:29,442 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:51:29,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:51:29,442 INFO L168 Benchmark]: Toolchain (without parser) took 1177.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -90.5 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:29,444 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:51:29,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:29,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:29,445 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:29,446 INFO L168 Benchmark]: RCFGBuilder took 621.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:29,446 INFO L168 Benchmark]: CodeCheck took 234.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:29,447 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:51:29,450 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 53 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 33, overapproximation of bitwiseAnd at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 153. Possible FailurePath: [L17] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L149] double x = -0.0; [L20] double z; [L21] __int32_t sign = 0x80000000; [L22] __uint32_t r, t1, s1, ix1, q1; [L23] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] ieee_double_shape_type ew_u; [L27] ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] (ix0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] (ix1) = ew_u.parts.lsw [L32] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L33] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_sqrt(x); [L153] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L154] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 621.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. * CodeCheck took 234.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:51:30,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:51:30,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:51:30,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:51:30,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:51:30,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:51:30,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:51:30,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:51:30,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:51:30,907 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:51:30,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:51:30,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:51:30,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:51:30,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:51:30,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:51:30,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:51:30,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:51:30,913 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:51:30,915 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:51:30,916 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:51:30,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:51:30,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:51:30,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:51:30,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:51:30,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:51:30,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:51:30,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:51:30,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:51:30,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:51:30,923 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:51:30,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:51:30,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:51:30,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:51:30,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:51:30,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:51:30,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:51:30,926 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 02:51:30,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:51:30,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:51:30,938 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:51:30,938 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:51:30,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:51:30,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:51:30,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:51:30,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:51:30,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:51:30,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:51:30,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:51:30,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:51:30,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:51:30,940 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:51:30,940 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:51:30,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:51:30,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:51:30,940 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:51:30,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:51:30,940 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:51:30,940 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:51:30,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:51:30,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:51:30,941 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:51:30,942 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 788527977e7ebd7aa0a832758f41b65d3cbd270a [2018-11-23 02:51:30,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:51:30,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:51:30,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:51:30,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:51:30,984 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:51:30,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-11-23 02:51:31,019 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/ebd3a9d7b/f426f0b8ac2040638b49329a903333aa/FLAG6d1f0f0a4 [2018-11-23 02:51:31,417 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:51:31,417 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/sv-benchmarks/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-11-23 02:51:31,421 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/ebd3a9d7b/f426f0b8ac2040638b49329a903333aa/FLAG6d1f0f0a4 [2018-11-23 02:51:31,432 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/data/ebd3a9d7b/f426f0b8ac2040638b49329a903333aa [2018-11-23 02:51:31,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:51:31,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:51:31,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:51:31,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:51:31,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:51:31,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76cd9765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31, skipping insertion in model container [2018-11-23 02:51:31,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:51:31,464 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:51:31,604 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:51:31,608 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:51:31,640 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:51:31,662 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:51:31,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31 WrapperNode [2018-11-23 02:51:31,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:51:31,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:51:31,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:51:31,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:51:31,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:51:31,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:51:31,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:51:31,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:51:31,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... [2018-11-23 02:51:31,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:51:31,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:51:31,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:51:31,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:51:31,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:51:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 02:51:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 02:51:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 02:51:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:51:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:51:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:51:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:51:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 02:51:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:51:31,990 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:51:33,555 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:51:36,412 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:51:36,412 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 02:51:36,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:36 BoogieIcfgContainer [2018-11-23 02:51:36,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:51:36,413 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:51:36,413 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:51:36,419 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:51:36,420 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:36" (1/1) ... [2018-11-23 02:51:36,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:51:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 27 states and 43 transitions. [2018-11-23 02:51:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2018-11-23 02:51:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 02:51:36,449 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:36,489 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:51:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:36,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:51:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2018-11-23 02:51:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2018-11-23 02:51:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 02:51:36,531 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:36,532 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:51:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:36,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:51:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 27 states and 39 transitions. [2018-11-23 02:51:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-11-23 02:51:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:51:37,829 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:37,830 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:51:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:37,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:51:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 29 states and 42 transitions. [2018-11-23 02:51:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2018-11-23 02:51:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 02:51:55,630 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:55,631 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:51:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:56,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:51:56,414 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:51:56,415 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:51:56,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 02:51:56,455 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:51:56,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:51:56,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-23 02:51:56,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:51:56,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 02:51:56,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:51:56,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 02:51:56,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:51:56,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:51:56,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:51:56,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:51:56,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:24 [2018-11-23 02:51:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 16 states and 17 transitions. [2018-11-23 02:51:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 02:51:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 02:51:57,067 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:57,068 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:51:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:57,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:51:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 16 states and 15 transitions. [2018-11-23 02:51:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-11-23 02:51:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:51:57,084 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:57,085 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:51:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:57,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:51:57,210 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:51:57,210 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:51:57,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 02:51:57,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:51:57,249 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:51:57,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-23 02:51:57,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:51:57,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 02:51:57,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:51:57,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 02:51:57,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:51:57,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:51:57,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:51:57,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:51:57,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2018-11-23 02:51:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 14 states and 13 transitions. [2018-11-23 02:51:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 02:51:57,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:51:57,706 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 7 iterations. [2018-11-23 02:51:57,711 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 02:51:57,767 INFO L579 CodeCheckObserver]: Invariant with dag size 4 [2018-11-23 02:51:57,773 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 02:51:57,773 INFO L579 CodeCheckObserver]: Invariant with dag size 13 [2018-11-23 02:51:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,776 INFO L579 CodeCheckObserver]: Invariant with dag size 10 [2018-11-23 02:51:57,776 INFO L579 CodeCheckObserver]: Invariant with dag size 4 [2018-11-23 02:51:57,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:51:57 ImpRootNode [2018-11-23 02:51:57,777 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:51:57,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:51:57,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:51:57,777 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:51:57,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:51:36" (3/4) ... [2018-11-23 02:51:57,781 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:51:57,788 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2018-11-23 02:51:57,788 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 02:51:57,805 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2018-11-23 02:51:57,806 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_q#valueAsBitvector_3 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0]) && v_q#valueAsBitvector_3[63:32] == msw) [2018-11-23 02:51:57,833 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f6535b7f-4a92-499d-b323-6c6a5883bce8/bin-2019/ukojak/witness.graphml [2018-11-23 02:51:57,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:51:57,834 INFO L168 Benchmark]: Toolchain (without parser) took 26398.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.8 MB in the beginning and 846.7 MB in the end (delta: 104.1 MB). Peak memory consumption was 234.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:57,835 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:51:57,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.92 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 933.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:57,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:57,837 INFO L168 Benchmark]: Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:51:57,837 INFO L168 Benchmark]: RCFGBuilder took 4640.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:57,838 INFO L168 Benchmark]: CodeCheck took 21364.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 853.6 MB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:57,838 INFO L168 Benchmark]: Witness Printer took 56.71 ms. Allocated memory is still 1.2 GB. Free memory was 853.6 MB in the beginning and 846.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:51:57,839 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 53 locations, 1 error locations. SAFE Result, 21.2s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 660 SDtfs, 262 SDslu, 196 SDs, 0 SdLazy, 838 SolverSat, 240 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 69.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 8 QuantifiedInterpolants, 2662 SizeOfPredicates, 25 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 154]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant [2018-11-23 02:51:57,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:51:57,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_3 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0]) && v_q#valueAsBitvector_3[63:32] == msw) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 225.92 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 933.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 4640.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. * CodeCheck took 21364.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 853.6 MB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. * Witness Printer took 56.71 ms. Allocated memory is still 1.2 GB. Free memory was 853.6 MB in the beginning and 846.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] RESULT: Ultimate proved your program to be correct! Received shutdown request...