./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1232b_false-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_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232b_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 064927d7c1e3d8158c8524deee46f65d988c7936 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232b_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 064927d7c1e3d8158c8524deee46f65d988c7936 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:14:16,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:14:16,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:14:16,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:14:16,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:14:16,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:14:16,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:14:16,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:14:16,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:14:16,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:14:16,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:14:16,678 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:14:16,679 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:14:16,679 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:14:16,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:14:16,680 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:14:16,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:14:16,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:14:16,683 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:14:16,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:14:16,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:14:16,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:14:16,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:14:16,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:14:16,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:14:16,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:14:16,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:14:16,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:14:16,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:14:16,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:14:16,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:14:16,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:14:16,693 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:14:16,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:14:16,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:14:16,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:14:16,694 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:14:16,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:14:16,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:14:16,705 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:14:16,705 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:14:16,705 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:14:16,705 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:14:16,705 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:14:16,705 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:14:16,706 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:14:16,706 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:14:16,706 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:14:16,706 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:14:16,706 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:14:16,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:14:16,707 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:14:16,707 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:14:16,707 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:14:16,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:14:16,707 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:14:16,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:14:16,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:14:16,708 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:14:16,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:14:16,708 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:14:16,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:14:16,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:14:16,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:14:16,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:14:16,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:14:16,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:14:16,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:14:16,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:14:16,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:14:16,709 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:14:16,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:14:16,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:14:16,710 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:14:16,710 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan 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 -> Taipan 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 -> 064927d7c1e3d8158c8524deee46f65d988c7936 [2018-11-23 12:14:16,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:14:16,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:14:16,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:14:16,747 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:14:16,748 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:14:16,748 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-11-23 12:14:16,794 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/871fea73c/50fb639f4306485c87b4510e6f7c1fe7/FLAG7c28460fd [2018-11-23 12:14:17,126 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:14:17,126 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/sv-benchmarks/c/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-11-23 12:14:17,132 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/871fea73c/50fb639f4306485c87b4510e6f7c1fe7/FLAG7c28460fd [2018-11-23 12:14:17,550 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/871fea73c/50fb639f4306485c87b4510e6f7c1fe7 [2018-11-23 12:14:17,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:14:17,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:14:17,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:14:17,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:14:17,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:14:17,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc3843d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17, skipping insertion in model container [2018-11-23 12:14:17,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:14:17,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:14:17,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:14:17,704 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:14:17,719 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:14:17,732 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:14:17,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17 WrapperNode [2018-11-23 12:14:17,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:14:17,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:14:17,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:14:17,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:14:17,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:14:17,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:14:17,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:14:17,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:14:17,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... [2018-11-23 12:14:17,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:14:17,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:14:17,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:14:17,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:14:17,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:14:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 12:14:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 12:14:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:14:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:14:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 12:14:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 12:14:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:14:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:14:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 12:14:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:14:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:14:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:14:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 12:14:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 12:14:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:14:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:14:18,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:14:18,035 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:14:18,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:18 BoogieIcfgContainer [2018-11-23 12:14:18,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:14:18,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:14:18,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:14:18,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:14:18,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:14:17" (1/3) ... [2018-11-23 12:14:18,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fff4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:14:18, skipping insertion in model container [2018-11-23 12:14:18,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:17" (2/3) ... [2018-11-23 12:14:18,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fff4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:14:18, skipping insertion in model container [2018-11-23 12:14:18,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:18" (3/3) ... [2018-11-23 12:14:18,042 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b_false-unreach-call.c [2018-11-23 12:14:18,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:14:18,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:14:18,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:14:18,084 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:14:18,084 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:14:18,084 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:14:18,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:14:18,084 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:14:18,084 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:14:18,084 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:14:18,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:14:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 12:14:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:14:18,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:18,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:18,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:18,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2125018936, now seen corresponding path program 1 times [2018-11-23 12:14:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:14:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:14:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:18,196 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 12:14:18,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:18,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:14:18,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:14:18,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:14:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:14:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:14:18,212 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-23 12:14:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,226 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2018-11-23 12:14:18,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:14:18,227 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 12:14:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:18,235 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:14:18,235 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:14:18,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:14:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:14:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:14:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:14:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 12:14:18,266 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2018-11-23 12:14:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:18,266 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 12:14:18,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:14:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:14:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:14:18,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:18,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:18,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:18,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2099930979, now seen corresponding path program 1 times [2018-11-23 12:14:18,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:14:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:14:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:18,344 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 12:14:18,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:18,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:18,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:14:18,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:18,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:18,346 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 12:14:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,368 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 12:14:18,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:18,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:14:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:18,370 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:14:18,370 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:14:18,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:14:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:14:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:14:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:14:18,376 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2018-11-23 12:14:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:18,377 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:14:18,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:14:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:14:18,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:18,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:18,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:18,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2011933537, now seen corresponding path program 1 times [2018-11-23 12:14:18,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:14:18,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:18,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:14:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:18,430 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 12:14:18,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:18,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:18,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:14:18,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:18,431 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-23 12:14:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,456 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 12:14:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:18,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 12:14:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:18,457 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:14:18,457 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:14:18,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:14:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 12:14:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:14:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:14:18,461 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2018-11-23 12:14:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:18,462 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:14:18,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:14:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:14:18,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:18,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:18,463 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:18,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 486082400, now seen corresponding path program 1 times [2018-11-23 12:14:18,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:14:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:14:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:14:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:14:18,511 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4293918726, |#NULL.offset|=4293918722, |old(#NULL.base)|=4293918726, |old(#NULL.offset)|=4293918722] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918726, |old(#NULL.offset)|=4293918722] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918726, |old(#NULL.offset)|=4293918722] [?] RET #90#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someUnaryDOUBLEoperation(0.0);~y~0 := 0.0; VAL [main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4293918727.0, |fmin_double_#in~y|=0.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_double_~x=4293918727.0, fmin_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4293918727.0, |fmin_double_#in~y|=0.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0] [?] goto; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0] [?] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0] [?] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0] [?] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0] [?] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918727.0, |__fpclassify_double_#res|=0] [?] RET #98#return; VAL [fmin_double_~x=4293918727.0, fmin_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4293918727.0, |fmin_double_#in~y|=0.0, |fmin_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmin_double_~x=4293918727.0, fmin_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4293918727.0, |fmin_double_#in~y|=0.0, |fmin_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmin_double_~x=4293918727.0, fmin_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4293918727.0, |fmin_double_#in~y|=0.0, |fmin_double_#res|=0.0] [?] assume true; VAL [fmin_double_~x=4293918727.0, fmin_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4293918727.0, |fmin_double_#in~y|=0.0, |fmin_double_#res|=0.0] [?] RET #94#return; VAL [main_~x~0=4293918727.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=0.0] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [main_~res~0=0.0, main_~x~0=4293918727.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11; VAL [main_~res~0=0.0, main_~x~0=4293918727.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~short11;havoc #t~ret10; VAL [main_~res~0=0.0, main_~x~0=4293918727.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=0.0, main_~x~0=4293918727.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918726, #NULL.offset=4293918722, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L74] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L75] ~y~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~y~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, ~x=4.293918727E9, ~y=0.0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~x=4.293918727E9] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L23] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L24] ~msw~0 := #t~mem0; [L24] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L25] ~lsw~0 := #t~mem2; [L25] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L28-L42] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L31-L42] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L34-L42] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L38-L42] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L42] #res := 0; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L18-L43] ensures true; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46-L47] assume 0 == #t~ret4; [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L45-L52] ensures true; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918726, #NULL.offset=4293918722, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L74] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L75] ~y~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~y~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, ~x=4.293918727E9, ~y=0.0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~x=4.293918727E9] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L23] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L24] ~msw~0 := #t~mem0; [L24] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L25] ~lsw~0 := #t~mem2; [L25] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L28-L42] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L31-L42] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L34-L42] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L38-L42] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L42] #res := 0; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L18-L43] ensures true; VAL [#in~x=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46-L47] assume 0 == #t~ret4; [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L45-L52] ensures true; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L75] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9, ~y=0.0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L75] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9, ~y=0.0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L75] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9, ~y=0.0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L75] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9, ~y=0.0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918727E9] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918727E9] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918727E9, ~y=0.0] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=4.293918727E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918727E9, ~y=0.0] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918727E9, ~y~0=0.0] [L74] double x = -0.0; [L75] double y = 0.0; VAL [y=0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4293918727, \old(y)=0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4293918727] [L19] __uint32_t msw, lsw; VAL [\old(x)=4293918727, x=4293918727] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4293918727, lsw=1, msw=4293918721, x=4293918727] [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4293918727, lsw=1, msw=4293918721, x=4293918727] [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4293918727, lsw=1, msw=4293918721, x=4293918727] [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; VAL [\old(x)=4293918727, \result=0, lsw=1, msw=4293918721, x=4293918727] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4293918727, \old(y)=0, __fpclassify_double(x)=0, x=4293918727, y=0] [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; VAL [\old(x)=4293918727, \old(y)=0, \result=0, x=4293918727, y=0] [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0, x=4293918727, y=0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0, res == -0.0 && __signbit_double(res) == 1=0, x=4293918727, y=0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0, x=4293918727, y=0] ----- [2018-11-23 12:14:18,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:14:18 BoogieIcfgContainer [2018-11-23 12:14:18,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:14:18,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:14:18,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:14:18,543 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:14:18,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:18" (3/4) ... [2018-11-23 12:14:18,546 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:14:18,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:14:18,546 INFO L168 Benchmark]: Toolchain (without parser) took 993.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -94.3 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:18,547 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:14:18,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.88 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:18,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.14 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:14:18,548 INFO L168 Benchmark]: Boogie Preprocessor took 56.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:18,549 INFO L168 Benchmark]: RCFGBuilder took 231.25 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:18,549 INFO L168 Benchmark]: TraceAbstraction took 506.39 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:18,549 INFO L168 Benchmark]: Witness Printer took 2.90 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 12:14:18,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.88 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.14 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.25 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 506.39 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.90 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 74. Possible FailurePath: [L74] double x = -0.0; [L75] double y = 0.0; VAL [y=0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4293918727, \old(y)=0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4293918727] [L19] __uint32_t msw, lsw; VAL [\old(x)=4293918727, x=4293918727] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4293918727, lsw=1, msw=4293918721, x=4293918727] [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4293918727, lsw=1, msw=4293918721, x=4293918727] [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4293918727, lsw=1, msw=4293918721, x=4293918727] [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; VAL [\old(x)=4293918727, \result=0, lsw=1, msw=4293918721, x=4293918727] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4293918727, \old(y)=0, __fpclassify_double(x)=0, x=4293918727, y=0] [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; VAL [\old(x)=4293918727, \old(y)=0, \result=0, x=4293918727, y=0] [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0, x=4293918727, y=0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0, res == -0.0 && __signbit_double(res) == 1=0, x=4293918727, y=0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0, x=4293918727, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 0 SDslu, 172 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 1926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 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 12:14:19,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:14:19,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:14:19,933 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:14:19,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:14:19,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:14:19,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:14:19,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:14:19,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:14:19,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:14:19,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:14:19,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:14:19,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:14:19,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:14:19,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:14:19,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:14:19,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:14:19,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:14:19,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:14:19,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:14:19,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:14:19,947 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:14:19,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:14:19,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:14:19,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:14:19,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:14:19,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:14:19,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:14:19,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:14:19,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:14:19,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:14:19,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:14:19,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:14:19,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:14:19,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:14:19,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:14:19,955 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 12:14:19,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:14:19,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:14:19,968 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:14:19,968 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:14:19,968 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:14:19,968 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:14:19,968 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:14:19,968 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:14:19,968 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:14:19,969 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:14:19,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:14:19,969 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:14:19,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:14:19,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:14:19,970 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:14:19,971 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:14:19,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:14:19,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:14:19,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:14:19,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:14:19,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:14:19,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:14:19,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:14:19,972 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:14:19,972 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 12:14:19,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:14:19,972 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:14:19,972 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:14:19,972 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_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan 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 -> Taipan 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 -> 064927d7c1e3d8158c8524deee46f65d988c7936 [2018-11-23 12:14:20,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:14:20,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:14:20,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:14:20,012 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:14:20,012 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:14:20,013 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-11-23 12:14:20,048 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/975888900/990f8bc00d234c06b5b5b37515d22c01/FLAG9e05d458a [2018-11-23 12:14:20,444 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:14:20,444 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/sv-benchmarks/c/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-11-23 12:14:20,449 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/975888900/990f8bc00d234c06b5b5b37515d22c01/FLAG9e05d458a [2018-11-23 12:14:20,458 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/data/975888900/990f8bc00d234c06b5b5b37515d22c01 [2018-11-23 12:14:20,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:14:20,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:14:20,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:14:20,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:14:20,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:14:20,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20, skipping insertion in model container [2018-11-23 12:14:20,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:14:20,486 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:14:20,610 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:14:20,614 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:14:20,635 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:14:20,654 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:14:20,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20 WrapperNode [2018-11-23 12:14:20,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:14:20,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:14:20,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:14:20,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:14:20,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:14:20,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:14:20,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:14:20,674 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:14:20,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... [2018-11-23 12:14:20,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:14:20,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:14:20,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:14:20,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:14:20,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:14:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 12:14:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 12:14:20,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 12:14:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:14:20,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:14:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 12:14:20,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 12:14:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:14:20,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:14:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:14:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 12:14:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:14:20,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:14:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 12:14:20,786 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 12:14:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:14:20,899 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 12:14:20,952 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 12:14:21,001 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:14:21,001 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:14:21,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:21 BoogieIcfgContainer [2018-11-23 12:14:21,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:14:21,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:14:21,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:14:21,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:14:21,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:14:20" (1/3) ... [2018-11-23 12:14:21,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410a2aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:14:21, skipping insertion in model container [2018-11-23 12:14:21,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:20" (2/3) ... [2018-11-23 12:14:21,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410a2aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:14:21, skipping insertion in model container [2018-11-23 12:14:21,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:21" (3/3) ... [2018-11-23 12:14:21,008 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b_false-unreach-call.c [2018-11-23 12:14:21,013 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:14:21,018 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:14:21,030 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:14:21,049 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:14:21,050 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:14:21,050 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:14:21,050 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:14:21,050 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:14:21,050 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:14:21,050 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:14:21,050 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:14:21,050 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:14:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:14:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:14:21,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:21,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:21,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:21,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -397395125, now seen corresponding path program 1 times [2018-11-23 12:14:21,071 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:21,072 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:21,135 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 12:14:21,135 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:21,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:21,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:14:21,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:14:21,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:14:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:14:21,159 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:14:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,175 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-23 12:14:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:14:21,176 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 12:14:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:21,183 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:14:21,183 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:14:21,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:14:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:14:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:14:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:14:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:14:21,213 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2018-11-23 12:14:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:21,214 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:14:21,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:14:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:14:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:14:21,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:21,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:21,216 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:21,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:21,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2145002868, now seen corresponding path program 1 times [2018-11-23 12:14:21,217 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:21,217 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:21,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:21,292 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 12:14:21,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:21,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:21,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:21,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,303 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 12:14:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,339 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:14:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:21,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:14:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:21,342 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:14:21,342 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:14:21,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:14:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:14:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:14:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:14:21,350 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2018-11-23 12:14:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:21,351 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:14:21,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:14:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:14:21,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:21,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:21,352 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:21,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:21,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1859452024, now seen corresponding path program 1 times [2018-11-23 12:14:21,353 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:21,353 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:21,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:21,431 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 12:14:21,431 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:21,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:21,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:21,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,439 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 12:14:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,475 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 12:14:21,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:21,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:14:21,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:21,476 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:14:21,476 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:14:21,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:14:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:14:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:14:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:14:21,481 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 23 [2018-11-23 12:14:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:21,481 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:14:21,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:14:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:14:21,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:21,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:21,482 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:21,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1911602824, now seen corresponding path program 1 times [2018-11-23 12:14:21,483 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:21,483 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:21,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:21,552 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 12:14:21,552 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:21,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:21,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:21,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:21,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,560 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 12:14:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,599 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 12:14:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:21,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 12:14:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:21,601 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:14:21,601 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:14:21,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:14:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:14:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:14:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:14:21,606 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2018-11-23 12:14:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:21,607 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:14:21,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:14:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:14:21,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:21,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:21,608 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:21,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:21,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2064132100, now seen corresponding path program 1 times [2018-11-23 12:14:21,608 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:21,608 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:21,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:21,682 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 12:14:21,682 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:21,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:21,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:21,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:21,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,694 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 12:14:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,726 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 12:14:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:21,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:14:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:21,728 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:14:21,728 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:14:21,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:14:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:14:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:14:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:14:21,733 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 25 [2018-11-23 12:14:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:21,733 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:14:21,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:14:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:14:21,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:21,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:21,734 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:21,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1867618595, now seen corresponding path program 1 times [2018-11-23 12:14:21,735 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:21,735 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:21,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:21,828 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 12:14:21,829 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:21,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:21,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:14:21,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:14:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:14:21,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:14:21,837 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 7 states. [2018-11-23 12:14:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,066 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 12:14:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:14:22,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 12:14:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:22,067 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:14:22,067 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:14:22,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:14:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:14:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:14:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 12:14:22,071 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 25 [2018-11-23 12:14:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:22,071 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 12:14:22,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:14:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 12:14:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:14:22,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:22,072 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:22,072 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:22,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1438845801, now seen corresponding path program 1 times [2018-11-23 12:14:22,073 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:22,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:14:22,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:22,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:22,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:22,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:22,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:22,154 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-11-23 12:14:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,187 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 12:14:22,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:22,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 12:14:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:22,189 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:14:22,189 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:14:22,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:14:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:14:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:14:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:14:22,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 30 [2018-11-23 12:14:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:22,195 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:14:22,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:14:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:14:22,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:22,197 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:22,197 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:22,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash 394703345, now seen corresponding path program 1 times [2018-11-23 12:14:22,197 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:22,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:14:22,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:22,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:22,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:22,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:22,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:22,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:22,279 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 12:14:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,318 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 12:14:22,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:22,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-23 12:14:22,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:22,319 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:14:22,319 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:14:22,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:14:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 12:14:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:14:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:14:22,325 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2018-11-23 12:14:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:22,326 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:14:22,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:14:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:14:22,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:22,327 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:22,327 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:22,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1599971557, now seen corresponding path program 1 times [2018-11-23 12:14:22,328 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:22,328 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:22,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:22,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:14:22,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:22,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:22,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:22,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:22,412 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 12:14:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,450 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 12:14:22,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:22,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 12:14:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:22,452 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:14:22,452 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:14:22,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:14:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 12:14:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:14:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:14:22,456 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 32 [2018-11-23 12:14:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:22,456 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:14:22,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:14:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:14:22,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:22,457 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:22,457 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:22,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1200719566, now seen corresponding path program 1 times [2018-11-23 12:14:22,458 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:22,458 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:22,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:22,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:14:22,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:22,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:22,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:14:22,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:14:22,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:14:22,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:14:22,617 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 5 states. [2018-11-23 12:14:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,721 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-23 12:14:22,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:14:22,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:14:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:22,722 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:14:22,722 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:14:22,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:14:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:14:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:14:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:14:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 12:14:22,726 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 12:14:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:22,726 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 12:14:22,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:14:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 12:14:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:14:22,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:22,727 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:22,727 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:22,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash 391372940, now seen corresponding path program 1 times [2018-11-23 12:14:22,728 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:22,728 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:22,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:14:22,856 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:22,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:22,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:14:22,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:14:22,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:14:22,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:22,864 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 8 states. [2018-11-23 12:14:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:23,152 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 12:14:23,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:14:23,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-23 12:14:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:23,153 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:14:23,153 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:14:23,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:14:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-23 12:14:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:14:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 12:14:23,158 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 12:14:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:23,159 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 12:14:23,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:14:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 12:14:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:14:23,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:23,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:23,160 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:23,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:23,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1382034430, now seen corresponding path program 1 times [2018-11-23 12:14:23,160 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:23,161 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:23,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:23,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:23,269 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:14:23,270 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:14:23,273 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 12:14:23,309 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:14:23,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 12:14:23,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:14:23,323 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 12:14:23,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 12:14:23,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:14:23,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:14:23,332 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 12:14:23,337 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 12:14:23,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 12:14:23,447 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 12:14:23,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:23,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:23,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:14:23,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:14:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:14:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:23,456 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 8 states. [2018-11-23 12:14:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:26,218 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2018-11-23 12:14:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:14:26,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:14:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:26,220 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:14:26,220 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:14:26,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:14:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:14:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:14:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 12:14:26,226 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2018-11-23 12:14:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:26,226 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 12:14:26,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:14:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 12:14:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:14:26,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:26,227 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:26,227 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:26,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash -477473555, now seen corresponding path program 1 times [2018-11-23 12:14:26,228 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:26,228 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:26,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:26,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:14:26,306 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:26,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:26,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:14:26,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:26,314 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-11-23 12:14:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:26,363 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 12:14:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:26,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 12:14:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:26,364 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:14:26,365 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:14:26,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:14:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-23 12:14:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:14:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 12:14:26,368 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2018-11-23 12:14:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:26,368 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 12:14:26,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 12:14:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:14:26,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:26,369 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:26,369 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:26,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash -673987060, now seen corresponding path program 1 times [2018-11-23 12:14:26,370 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:26,370 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:26,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:26,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:14:26,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:14:26,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:14:26,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:14:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:14:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:14:26,476 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2018-11-23 12:14:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:26,637 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-23 12:14:26,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:14:26,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 12:14:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:26,638 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:14:26,638 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:14:26,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:14:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 12:14:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:14:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 12:14:26,642 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 33 [2018-11-23 12:14:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:26,642 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 12:14:26,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:14:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:14:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:14:26,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:26,643 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:26,643 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:26,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash -25386389, now seen corresponding path program 1 times [2018-11-23 12:14:26,644 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:14:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-23 12:14:26,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:14:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:14:26,947 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv6 32), |#NULL.offset|=(_ bv5 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] RET #88#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());~y~0 := ~Pluszero~DOUBLE(); VAL [main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;~y := #in~y; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #96#return; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#t~ret4|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret4);havoc #t~ret4; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret5 := __fpclassify_double(~y); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #98#return; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#t~ret5|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret5);havoc #t~ret5; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume !~fp.lt~DOUBLE(~x, ~y);#t~ite6 := ~y; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#t~ite6|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := #t~ite6;havoc #t~ite6; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#res|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume true; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#res|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] RET #92#return; VAL [main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret9|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] assume #t~short11; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] CALL call #t~ret10 := __signbit_double(~res~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~1; VAL [__signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32);~msw~1 := #t~mem7;call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);havoc #t~mem7;havoc #t~union8;call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset);havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv0 32)] [?] assume true; VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv0 32)] [?] RET #94#return; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv0 32), |main_#t~short11|=true] [?] #t~short11 := 1bv32 == #t~ret10; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv0 32), |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~short11;havoc #t~ret10; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46-L47] assume !(0bv32 == #t~ret4); [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48-L49] assume !(0bv32 == #t~ret5); [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] assume !~fp.lt~DOUBLE(~x, ~y); [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L45-L52] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L59] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L60] ~msw~1 := #t~mem7; [L60] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L58] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L54-L64] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46-L47] assume !(0bv32 == #t~ret4); [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48-L49] assume !(0bv32 == #t~ret5); [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] assume !~fp.lt~DOUBLE(~x, ~y); [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L45-L52] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L59] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L60] ~msw~1 := #t~mem7; [L60] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L58] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L54-L64] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L74] double x = -0.0; [L75] double y = 0.0; VAL [x=0.0, y=0.0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=0.0, \old(y)=0.0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=-2147483648, x=0.0] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(x)=2, x=0.0, y=0.0] [L46] COND FALSE !(__fpclassify_double(x) == 0) [L48] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=0, x=0.0] [L48] RET, EXPR __fpclassify_double(y) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(y)=2, x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(y) == 0) [L51] EXPR x < y ? x : y VAL [\old(x)=0.0, \old(y)=0.0, x=0.0, x < y ? x : y=0.0, y=0.0] [L51] return x < y ? x : y; [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0.0, x=0.0, y=0.0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] CALL, EXPR __signbit_double(res) VAL [\old(x)=0.0] [L55] __uint32_t msw; VAL [\old(x)=0.0, x=0.0] [L58] ieee_double_shape_type gh_u; [L59] gh_u.value = (x) [L60] EXPR gh_u.parts.msw [L60] (msw) = gh_u.parts.msw [L63] return (msw & 0x80000000) != 0; VAL [\old(x)=0.0, \result=0, msw=0, x=0.0] [L79] RET, EXPR __signbit_double(res) VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=0, x=0.0, y=0.0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0.0, x=0.0, y=0.0] ----- [2018-11-23 12:14:27,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:14:27 BoogieIcfgContainer [2018-11-23 12:14:27,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:14:27,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:14:27,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:14:27,011 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:14:27,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:21" (3/4) ... [2018-11-23 12:14:27,017 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv6 32), |#NULL.offset|=(_ bv5 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] RET #88#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());~y~0 := ~Pluszero~DOUBLE(); VAL [main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;~y := #in~y; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #96#return; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#t~ret4|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret4);havoc #t~ret4; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret5 := __fpclassify_double(~y); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #98#return; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#t~ret5|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret5);havoc #t~ret5; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume !~fp.lt~DOUBLE(~x, ~y);#t~ite6 := ~y; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#t~ite6|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := #t~ite6;havoc #t~ite6; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#res|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume true; VAL [fmin_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmin_double_~y=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmin_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#in~y|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmin_double_#res|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] RET #92#return; VAL [main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret9|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] assume #t~short11; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] CALL call #t~ret10 := __signbit_double(~res~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~1; VAL [__signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32);~msw~1 := #t~mem7;call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);havoc #t~mem7;havoc #t~union8;call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset);havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv0 32)] [?] assume true; VAL [__signbit_double_~msw~1=(_ bv0 32), __signbit_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv0 32)] [?] RET #94#return; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv0 32), |main_#t~short11|=true] [?] #t~short11 := 1bv32 == #t~ret10; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv0 32), |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~short11;havoc #t~ret10; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~res~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46-L47] assume !(0bv32 == #t~ret4); [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48-L49] assume !(0bv32 == #t~ret5); [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] assume !~fp.lt~DOUBLE(~x, ~y); [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L45-L52] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L59] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L60] ~msw~1 := #t~mem7; [L60] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L58] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L54-L64] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46-L47] assume !(0bv32 == #t~ret4); [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L23] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L24] ~msw~0 := #t~mem0; [L24] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L42] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L18-L43] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48-L49] assume !(0bv32 == #t~ret5); [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] assume !~fp.lt~DOUBLE(~x, ~y); [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L45-L52] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L59] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L60] ~msw~1 := #t~mem7; [L60] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L58] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L54-L64] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L74] ~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); [L75] ~y~0 := ~Pluszero~DOUBLE(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L46] COND FALSE !(0bv32 == #t~ret4) [L46] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L23] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L28-L29] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L30] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L48] COND FALSE !(0bv32 == #t~ret5) [L48] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] COND FALSE !(~fp.lt~DOUBLE(~x, ~y)) [L51] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L51] #res := #t~ite6; [L51] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L54-L64] ~x := #in~x; [L55] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L58] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L59] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L60] ~msw~1 := #t~mem7; [L60] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L60] havoc #t~mem7; [L60] havoc #t~union8; [L58] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L58] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L63] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, ~msw~1=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] #t~short11 := 1bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=0bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L80] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L74] double x = -0.0; [L75] double y = 0.0; VAL [x=0.0, y=0.0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=0.0, \old(y)=0.0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=-2147483648, x=0.0] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(x)=2, x=0.0, y=0.0] [L46] COND FALSE !(__fpclassify_double(x) == 0) [L48] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=0, x=0.0] [L48] RET, EXPR __fpclassify_double(y) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(y)=2, x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(y) == 0) [L51] EXPR x < y ? x : y VAL [\old(x)=0.0, \old(y)=0.0, x=0.0, x < y ? x : y=0.0, y=0.0] [L51] return x < y ? x : y; [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0.0, x=0.0, y=0.0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] CALL, EXPR __signbit_double(res) VAL [\old(x)=0.0] [L55] __uint32_t msw; VAL [\old(x)=0.0, x=0.0] [L58] ieee_double_shape_type gh_u; [L59] gh_u.value = (x) [L60] EXPR gh_u.parts.msw [L60] (msw) = gh_u.parts.msw [L63] return (msw & 0x80000000) != 0; VAL [\old(x)=0.0, \result=0, msw=0, x=0.0] [L79] RET, EXPR __signbit_double(res) VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=0, x=0.0, y=0.0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0.0, x=0.0, y=0.0] ----- [2018-11-23 12:14:27,239 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_90b330d7-fdba-4c03-8951-51949e96f873/bin-2019/utaipan/witness.graphml [2018-11-23 12:14:27,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:14:27,240 INFO L168 Benchmark]: Toolchain (without parser) took 6779.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:27,241 INFO L168 Benchmark]: CDTParser took 0.12 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 12:14:27,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:27,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.69 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:14:27,241 INFO L168 Benchmark]: Boogie Preprocessor took 70.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -208.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:27,242 INFO L168 Benchmark]: RCFGBuilder took 257.04 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:27,242 INFO L168 Benchmark]: TraceAbstraction took 6008.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.4 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:27,242 INFO L168 Benchmark]: Witness Printer took 228.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:14:27,244 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 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 193.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.69 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -208.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.04 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6008.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.4 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * Witness Printer took 228.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 80]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] double x = -0.0; [L75] double y = 0.0; VAL [x=0.0, y=0.0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=0.0, \old(y)=0.0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=-2147483648, x=0.0] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(x)=2, x=0.0, y=0.0] [L46] COND FALSE !(__fpclassify_double(x) == 0) [L48] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=0, x=0.0] [L48] RET, EXPR __fpclassify_double(y) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(y)=2, x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(y) == 0) [L51] EXPR x < y ? x : y VAL [\old(x)=0.0, \old(y)=0.0, x=0.0, x < y ? x : y=0.0, y=0.0] [L51] return x < y ? x : y; [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0.0, x=0.0, y=0.0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] CALL, EXPR __signbit_double(res) VAL [\old(x)=0.0] [L55] __uint32_t msw; VAL [\old(x)=0.0, x=0.0] [L58] ieee_double_shape_type gh_u; [L59] gh_u.value = (x) [L60] EXPR gh_u.parts.msw [L60] (msw) = gh_u.parts.msw [L63] return (msw & 0x80000000) != 0; VAL [\old(x)=0.0, \result=0, msw=0, x=0.0] [L79] RET, EXPR __signbit_double(res) VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=0, x=0.0, y=0.0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0.0, x=0.0, y=0.0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. UNSAFE Result, 5.9s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 629 SDtfs, 91 SDslu, 1532 SDs, 0 SdLazy, 323 SolverSat, 17 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 28 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 382 ConstructedInterpolants, 10 QuantifiedInterpolants, 23799 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...