./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1052b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1052b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 02d9fa71bb5dc4dc4df0d2e6f9518debee649c89 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1052b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 02d9fa71bb5dc4dc4df0d2e6f9518debee649c89 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:12:49,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:12:49,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:12:49,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:12:49,613 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:12:49,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:12:49,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:12:49,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:12:49,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:12:49,617 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:12:49,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:12:49,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:12:49,619 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:12:49,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:12:49,620 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:12:49,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:12:49,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:12:49,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:12:49,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:12:49,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:12:49,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:12:49,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:12:49,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:12:49,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:12:49,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:12:49,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:12:49,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:12:49,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:12:49,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:12:49,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:12:49,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:12:49,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:12:49,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:12:49,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:12:49,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:12:49,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:12:49,634 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 06:12:49,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:12:49,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:12:49,645 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:12:49,645 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:12:49,645 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:12:49,645 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:12:49,645 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:12:49,645 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:12:49,645 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:12:49,646 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:12:49,646 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:12:49,646 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:12:49,646 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:12:49,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:12:49,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:12:49,648 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:12:49,648 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:12:49,648 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:12:49,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:12:49,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:12:49,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:12:49,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:12:49,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:12:49,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:12:49,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:12:49,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:12:49,649 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:12:49,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:12:49,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:12:49,649 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 06:12:49,649 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_516eac9e-d737-4e58-ac59-bab2dad6481c/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 -> 02d9fa71bb5dc4dc4df0d2e6f9518debee649c89 [2018-11-23 06:12:49,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:12:49,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:12:49,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:12:49,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:12:49,682 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:12:49,682 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1052b_true-unreach-call.c [2018-11-23 06:12:49,717 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/016b8cee6/60ff6f897fe14579919b33dc243d8386/FLAGf95e93106 [2018-11-23 06:12:50,026 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:12:50,026 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/sv-benchmarks/c/float-newlib/float_req_bl_1052b_true-unreach-call.c [2018-11-23 06:12:50,032 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/016b8cee6/60ff6f897fe14579919b33dc243d8386/FLAGf95e93106 [2018-11-23 06:12:50,042 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/016b8cee6/60ff6f897fe14579919b33dc243d8386 [2018-11-23 06:12:50,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:12:50,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:12:50,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:12:50,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:12:50,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:12:50,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50, skipping insertion in model container [2018-11-23 06:12:50,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:12:50,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:12:50,192 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:12:50,195 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:12:50,214 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:12:50,228 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:12:50,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50 WrapperNode [2018-11-23 06:12:50,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:12:50,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:12:50,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:12:50,229 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:12:50,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:12:50,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:12:50,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:12:50,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:12:50,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... [2018-11-23 06:12:50,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:12:50,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:12:50,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:12:50,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:12:50,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 06:12:50,335 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:12:50,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-11-23 06:12:50,335 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-11-23 06:12:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:12:50,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:12:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:12:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:12:50,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:12:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:12:50,514 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:12:50,514 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 06:12:50,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:12:50 BoogieIcfgContainer [2018-11-23 06:12:50,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:12:50,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:12:50,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:12:50,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:12:50,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:12:50" (1/3) ... [2018-11-23 06:12:50,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c729805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:12:50, skipping insertion in model container [2018-11-23 06:12:50,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:50" (2/3) ... [2018-11-23 06:12:50,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c729805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:12:50, skipping insertion in model container [2018-11-23 06:12:50,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:12:50" (3/3) ... [2018-11-23 06:12:50,520 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052b_true-unreach-call.c [2018-11-23 06:12:50,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:12:50,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:12:50,550 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:12:50,574 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:12:50,574 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:12:50,574 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:12:50,574 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:12:50,575 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:12:50,575 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:12:50,575 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:12:50,575 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:12:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 06:12:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 06:12:50,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:12:50,593 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 06:12:50,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:12:50,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:12:50,599 INFO L82 PathProgramCache]: Analyzing trace with hash -305625155, now seen corresponding path program 1 times [2018-11-23 06:12:50,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:12:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:12:50,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:12:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:12:50,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:12:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:12:50,688 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 06:12:50,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:12:50,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:12:50,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:12:50,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 06:12:50,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:12:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:12:50,702 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 06:12:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:12:50,716 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2018-11-23 06:12:50,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:12:50,717 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 06:12:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:12:50,725 INFO L225 Difference]: With dead ends: 76 [2018-11-23 06:12:50,725 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 06:12:50,728 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 06:12:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 06:12:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 06:12:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 06:12:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 06:12:50,754 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 24 [2018-11-23 06:12:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:12:50,755 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 06:12:50,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 06:12:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 06:12:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 06:12:50,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:12:50,756 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 06:12:50,756 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:12:50,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:12:50,757 INFO L82 PathProgramCache]: Analyzing trace with hash -231212118, now seen corresponding path program 1 times [2018-11-23 06:12:50,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:12:50,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:12:50,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:12:50,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:12:50,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:12:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:12:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:12:50,841 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450953, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450950.0, ~huge_floor~0=6442450950.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_floor~0 := 1.0E30; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450950.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450950.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] RET #108#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call #t~ret6 := floor_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~j0~0;havoc ~i~0;havoc ~ix~0; VAL [floor_float_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] goto; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647);~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !(~j0~0 < 23); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !(~ix~0 % 4294967296 < 2139095040);#res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume true; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450954.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] RET #112#return; VAL [main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=6442450946.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~res~0 := #t~ret6;havoc #t~ret6; VAL [main_~res~0=6442450946.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call #t~ret7 := isinf_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450946.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~ix~1; VAL [isinf_float_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450946.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4);call #t~mem4 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4);~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union5, ~#gf_u~1.base, ~#gf_u~1.offset, 4);havoc #t~union5;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset);havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [isinf_float_~ix~1=3, isinf_float_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450946.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] goto; VAL [isinf_float_~ix~1=3, isinf_float_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450946.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647);#res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [isinf_float_~ix~1=0, isinf_float_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450946.0, |isinf_float_#res|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume true; VAL [isinf_float_~ix~1=0, isinf_float_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450946.0, |isinf_float_#res|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] RET #114#return; VAL [main_~res~0=6442450946.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [main_~res~0=6442450946.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume 0 == #t~ret7;havoc #t~ret7; VAL [main_~res~0=6442450946.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=6442450946.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450953, #NULL.offset=6442450945, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=6.44245095E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=6.442450954E9] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450954E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L13-L54] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450954E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=6.442450946E9] [L60] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L61] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] call #t~mem4 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] call write~real(#t~union5, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] havoc #t~union5; [L62] havoc #t~mem4; [L60] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L60] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~ix~1=3, ~x=6.442450946E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L57-L66] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L79] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79-L82] assume 0 == #t~ret7; [L79] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450953, #NULL.offset=6442450945, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=6.44245095E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=6.442450954E9] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450954E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L13-L54] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450954E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=6.442450946E9] [L60] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L61] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] call #t~mem4 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] call write~real(#t~union5, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] havoc #t~union5; [L62] havoc #t~mem4; [L60] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L60] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~ix~1=3, ~x=6.442450946E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L57-L66] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L79] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79-L82] assume 0 == #t~ret7; [L79] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=6.44245095E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450954E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450954E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450954E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450946E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~union5; [L62] havoc #t~mem4; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~ix~1=3, ~x=6.442450946E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L79] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] COND TRUE 0 == #t~ret7 [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=6.44245095E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450954E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450954E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450954E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450946E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~union5; [L62] havoc #t~mem4; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~ix~1=3, ~x=6.442450946E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L79] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] COND TRUE 0 == #t~ret7 [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=6.44245095E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450954E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450954E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450954E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450946E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~union5; [L62] havoc #t~mem4; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~ix~1=3, ~x=6.442450946E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L79] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] COND TRUE 0 == #t~ret7 [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=6.44245095E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.44245095E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450954E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450954E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450954E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450954E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450946E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~union5; [L62] havoc #t~mem4; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~ix~1=3, ~x=6.442450946E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E30, ~ix~1=0, ~x=6.442450946E9] [L79] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L79] COND TRUE 0 == #t~ret7 [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450954E9] [L11] static const float huge_floor = 1.0e30; VAL [\old(huge_floor)=6442450950, huge_floor=1000000000000000000000000000000] [L75] float x = -1.0f / 0.0f; VAL [huge_floor=1000000000000000000000000000000] [L76] CALL, EXPR floor_float(x) VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, x=6442450954] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450954] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450954] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450954] [L76] RET, EXPR floor_float(x) VAL [floor_float(x)=6442450946, huge_floor=1000000000000000000000000000000, x=6442450954] [L76] float res = floor_float(x); [L79] CALL, EXPR isinf_float(res) VAL [\old(x)=6442450946, huge_floor=1000000000000000000000000000000] [L58] __int32_t ix; VAL [\old(x)=6442450946, huge_floor=1000000000000000000000000000000, x=6442450946] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (ix) = gf_u.word [L64] ix &= 0x7fffffff [L65] return ((ix) == 0x7f800000L); VAL [\old(x)=6442450946, \result=0, huge_floor=1000000000000000000000000000000, ix=0, x=6442450946] [L79] RET, EXPR isinf_float(res) VAL [huge_floor=1000000000000000000000000000000, isinf_float(res)=0, res=6442450946, x=6442450954] [L79] COND TRUE !isinf_float(res) [L80] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000, res=6442450946, x=6442450954] ----- [2018-11-23 06:12:50,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:12:50 BoogieIcfgContainer [2018-11-23 06:12:50,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:12:50,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:12:50,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:12:50,877 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:12:50,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:12:50" (3/4) ... [2018-11-23 06:12:50,880 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:12:50,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:12:50,881 INFO L168 Benchmark]: Toolchain (without parser) took 836.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:50,882 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:12:50,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:50,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.32 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:12:50,883 INFO L168 Benchmark]: Boogie Preprocessor took 58.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:50,883 INFO L168 Benchmark]: RCFGBuilder took 212.58 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:50,884 INFO L168 Benchmark]: TraceAbstraction took 361.66 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:50,884 INFO L168 Benchmark]: Witness Printer took 2.95 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 06:12:50,886 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.32 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.58 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 361.66 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 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 someBinaryArithmeticFLOAToperation at line 44, overapproximation of bitwiseAnd at line 64. Possible FailurePath: [L11] static const float huge_floor = 1.0e30; VAL [\old(huge_floor)=6442450950, huge_floor=1000000000000000000000000000000] [L75] float x = -1.0f / 0.0f; VAL [huge_floor=1000000000000000000000000000000] [L76] CALL, EXPR floor_float(x) VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, x=6442450954] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450954] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450954] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=6442450954, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450954] [L76] RET, EXPR floor_float(x) VAL [floor_float(x)=6442450946, huge_floor=1000000000000000000000000000000, x=6442450954] [L76] float res = floor_float(x); [L79] CALL, EXPR isinf_float(res) VAL [\old(x)=6442450946, huge_floor=1000000000000000000000000000000] [L58] __int32_t ix; VAL [\old(x)=6442450946, huge_floor=1000000000000000000000000000000, x=6442450946] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (ix) = gf_u.word [L64] ix &= 0x7fffffff [L65] return ((ix) == 0x7f800000L); VAL [\old(x)=6442450946, \result=0, huge_floor=1000000000000000000000000000000, ix=0, x=6442450946] [L79] RET, EXPR isinf_float(res) VAL [huge_floor=1000000000000000000000000000000, isinf_float(res)=0, res=6442450946, x=6442450954] [L79] COND TRUE !isinf_float(res) [L80] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000, res=6442450946, x=6442450954] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 50 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 06:12:52,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:12:52,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:12:52,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:12:52,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:12:52,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:12:52,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:12:52,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:12:52,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:12:52,332 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:12:52,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:12:52,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:12:52,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:12:52,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:12:52,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:12:52,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:12:52,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:12:52,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:12:52,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:12:52,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:12:52,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:12:52,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:12:52,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:12:52,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:12:52,344 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:12:52,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:12:52,345 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:12:52,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:12:52,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:12:52,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:12:52,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:12:52,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:12:52,349 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:12:52,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:12:52,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:12:52,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:12:52,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 06:12:52,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:12:52,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:12:52,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:12:52,362 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:12:52,362 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:12:52,363 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:12:52,363 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:12:52,363 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:12:52,363 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:12:52,363 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:12:52,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:12:52,364 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:12:52,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:12:52,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:12:52,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:12:52,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:12:52,365 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:12:52,365 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:12:52,365 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:12:52,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:12:52,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:12:52,365 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:12:52,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:12:52,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:12:52,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:12:52,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:12:52,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:12:52,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:12:52,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:12:52,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:12:52,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:12:52,369 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 06:12:52,369 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:12:52,369 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:12:52,369 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:12:52,369 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_516eac9e-d737-4e58-ac59-bab2dad6481c/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 -> 02d9fa71bb5dc4dc4df0d2e6f9518debee649c89 [2018-11-23 06:12:52,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:12:52,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:12:52,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:12:52,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:12:52,411 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:12:52,412 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1052b_true-unreach-call.c [2018-11-23 06:12:52,456 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/2e75a42a7/80ba8040b796437bad29ba05a766b019/FLAGeaf972325 [2018-11-23 06:12:52,860 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:12:52,861 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/sv-benchmarks/c/float-newlib/float_req_bl_1052b_true-unreach-call.c [2018-11-23 06:12:52,867 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/2e75a42a7/80ba8040b796437bad29ba05a766b019/FLAGeaf972325 [2018-11-23 06:12:52,877 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/data/2e75a42a7/80ba8040b796437bad29ba05a766b019 [2018-11-23 06:12:52,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:12:52,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:12:52,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:12:52,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:12:52,883 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:12:52,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:12:52" (1/1) ... [2018-11-23 06:12:52,886 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 06:12:52, skipping insertion in model container [2018-11-23 06:12:52,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:12:52" (1/1) ... [2018-11-23 06:12:52,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:12:52,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:12:53,051 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:12:53,055 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:12:53,077 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:12:53,096 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:12:53,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53 WrapperNode [2018-11-23 06:12:53,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:12:53,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:12:53,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:12:53,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:12:53,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:12:53,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:12:53,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:12:53,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:12:53,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... [2018-11-23 06:12:53,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:12:53,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:12:53,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:12:53,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:12:53,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 06:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 06:12:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 06:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:12:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 06:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-11-23 06:12:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-11-23 06:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:12:53,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 06:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:12:53,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 06:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 06:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:12:53,444 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 06:12:53,661 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:12:53,661 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 06:12:53,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:12:53 BoogieIcfgContainer [2018-11-23 06:12:53,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:12:53,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:12:53,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:12:53,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:12:53,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:12:52" (1/3) ... [2018-11-23 06:12:53,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc043e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:12:53, skipping insertion in model container [2018-11-23 06:12:53,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:12:53" (2/3) ... [2018-11-23 06:12:53,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc043e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:12:53, skipping insertion in model container [2018-11-23 06:12:53,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:12:53" (3/3) ... [2018-11-23 06:12:53,667 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052b_true-unreach-call.c [2018-11-23 06:12:53,678 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:12:53,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:12:53,692 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:12:53,709 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:12:53,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:12:53,710 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:12:53,710 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:12:53,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:12:53,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:12:53,710 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:12:53,710 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:12:53,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:12:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 06:12:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 06:12:53,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:12:53,725 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 06:12:53,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:12:53,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:12:53,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1515461369, now seen corresponding path program 1 times [2018-11-23 06:12:53,733 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:12:53,733 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 06:12:53,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:12:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:12:53,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:12:53,806 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 06:12:53,807 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:12:53,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:12:53,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:12:53,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 06:12:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:12:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:12:53,826 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-23 06:12:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:12:53,839 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2018-11-23 06:12:53,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:12:53,840 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 06:12:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:12:53,846 INFO L225 Difference]: With dead ends: 74 [2018-11-23 06:12:53,846 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 06:12:53,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 06:12:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 06:12:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 06:12:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 06:12:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 06:12:53,875 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 23 [2018-11-23 06:12:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:12:53,875 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 06:12:53,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 06:12:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 06:12:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 06:12:53,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:12:53,876 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 06:12:53,876 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:12:53,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:12:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -521696202, now seen corresponding path program 1 times [2018-11-23 06:12:53,877 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:12:53,877 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 06:12:53,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:12:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:12:53,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:12:54,554 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 06:12:54,554 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:12:54,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:12:54,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 06:12:54,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 06:12:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 06:12:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:12:54,564 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2018-11-23 06:12:55,040 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 06:12:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:12:56,374 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 06:12:56,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 06:12:56,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-23 06:12:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:12:56,378 INFO L225 Difference]: With dead ends: 46 [2018-11-23 06:12:56,378 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 06:12:56,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 06:12:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 06:12:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 06:12:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 06:12:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 06:12:56,387 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2018-11-23 06:12:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:12:56,388 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 06:12:56,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 06:12:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 06:12:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 06:12:56,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:12:56,389 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 06:12:56,394 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:12:56,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:12:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash -815099209, now seen corresponding path program 1 times [2018-11-23 06:12:56,395 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:12:56,395 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 06:12:56,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:12:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:12:56,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:12:56,510 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 06:12:56,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:12:56,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:12:56,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:12:56,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:12:56,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:12:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:12:56,519 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 7 states. [2018-11-23 06:12:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:12:57,171 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 06:12:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:12:57,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 06:12:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:12:57,173 INFO L225 Difference]: With dead ends: 59 [2018-11-23 06:12:57,173 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 06:12:57,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:12:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 06:12:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-11-23 06:12:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 06:12:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 06:12:57,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2018-11-23 06:12:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:12:57,177 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 06:12:57,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:12:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 06:12:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 06:12:57,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:12:57,178 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 06:12:57,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:12:57,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:12:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1280692241, now seen corresponding path program 1 times [2018-11-23 06:12:57,179 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:12:57,179 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/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 06:12:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:12:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:12:57,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:12:57,284 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 06:12:57,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:12:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:12:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:12:57,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:12:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:12:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:12:57,297 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2018-11-23 06:12:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:12:57,919 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 06:12:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:12:57,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 06:12:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:12:57,920 INFO L225 Difference]: With dead ends: 42 [2018-11-23 06:12:57,920 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 06:12:57,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:12:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 06:12:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 06:12:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 06:12:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 06:12:57,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-23 06:12:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:12:57,922 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:12:57,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:12:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:12:57,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 06:12:57,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 06:12:57,981 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2018-11-23 06:12:57,981 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 59 63) the Hoare annotation is: (= |isinf_float_#in~x| isinf_float_~x) [2018-11-23 06:12:57,982 INFO L448 ceAbstractionStarter]: For program point L59-3(lines 59 63) no Hoare annotation was computed. [2018-11-23 06:12:57,982 INFO L451 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 57 66) the Hoare annotation is: true [2018-11-23 06:12:57,982 INFO L448 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 57 66) no Hoare annotation was computed. [2018-11-23 06:12:57,982 INFO L448 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 57 66) no Hoare annotation was computed. [2018-11-23 06:12:57,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 06:12:57,982 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 06:12:57,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 06:12:57,982 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 47) no Hoare annotation was computed. [2018-11-23 06:12:57,982 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 52) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 13 54) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L48-2(lines 48 52) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 41) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 20) the Hoare annotation is: (= |floor_float_#in~x| floor_float_~x) [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2018-11-23 06:12:57,983 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 38) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L448 ceAbstractionStarter]: For program point floor_floatEXIT(lines 13 54) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 35) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L448 ceAbstractionStarter]: For program point floor_floatFINAL(lines 13 54) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L451 ceAbstractionStarter]: At program point floor_floatENTRY(lines 13 54) the Hoare annotation is: true [2018-11-23 06:12:57,984 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 46) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 06:12:57,984 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 06:12:57,984 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 06:12:57,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 06:12:57,985 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 06:12:57,985 INFO L444 ceAbstractionStarter]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse0) main_~res~0) (= main_~x~0 .cse0))) [2018-11-23 06:12:57,985 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 79 82) no Hoare annotation was computed. [2018-11-23 06:12:57,985 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 68 85) the Hoare annotation is: true [2018-11-23 06:12:57,985 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 68 85) no Hoare annotation was computed. [2018-11-23 06:12:57,985 INFO L444 ceAbstractionStarter]: At program point L76(line 76) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) [2018-11-23 06:12:57,985 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-23 06:12:57,986 INFO L448 ceAbstractionStarter]: For program point L76-1(line 76) no Hoare annotation was computed. [2018-11-23 06:12:57,986 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 68 85) no Hoare annotation was computed. [2018-11-23 06:12:57,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:12:57 BoogieIcfgContainer [2018-11-23 06:12:57,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:12:57,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:12:57,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:12:57,997 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:12:57,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:12:53" (3/4) ... [2018-11-23 06:12:58,000 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 06:12:58,006 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-11-23 06:12:58,006 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 06:12:58,007 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure floor_float [2018-11-23 06:12:58,007 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 06:12:58,011 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-23 06:12:58,011 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 06:12:58,011 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 06:12:58,036 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 06:12:58,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 06:12:58,056 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_516eac9e-d737-4e58-ac59-bab2dad6481c/bin-2019/utaipan/witness.graphml [2018-11-23 06:12:58,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:12:58,057 INFO L168 Benchmark]: Toolchain (without parser) took 5178.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 949.7 MB in the beginning and 948.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 163.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:58,057 INFO L168 Benchmark]: CDTParser took 0.14 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 06:12:58,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.18 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 06:12:58,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.59 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 06:12:58,058 INFO L168 Benchmark]: Boogie Preprocessor took 74.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 933.6 MB in the beginning and 1.2 GB in the end (delta: -216.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:58,059 INFO L168 Benchmark]: RCFGBuilder took 468.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:58,059 INFO L168 Benchmark]: TraceAbstraction took 4333.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.9 MB in the end (delta: 176.8 MB). Peak memory consumption was 176.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:58,059 INFO L168 Benchmark]: Witness Printer took 59.57 ms. Allocated memory is still 1.2 GB. Free memory was 954.9 MB in the beginning and 948.3 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:12:58,061 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.14 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 217.18 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 21.59 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 74.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 933.6 MB in the beginning and 1.2 GB in the end (delta: -216.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 468.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4333.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.9 MB in the end (delta: 176.8 MB). Peak memory consumption was 176.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.57 ms. Allocated memory is still 1.2 GB. Free memory was 954.9 MB in the beginning and 948.3 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 163 SDslu, 396 SDs, 0 SdLazy, 264 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 16 PreInvPairs, 19 NumberOfFragments, 49 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 95 ConstructedInterpolants, 11 QuantifiedInterpolants, 11478 SizeOfPredicates, 14 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...