./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1072a_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_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1072a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 61816a63e70562669051a12493c2c5215c575cb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1072a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 61816a63e70562669051a12493c2c5215c575cb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 01:52:08,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:52:08,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:52:08,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:52:08,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:52:08,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:52:08,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:52:08,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:52:08,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:52:08,770 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:52:08,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:52:08,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:52:08,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:52:08,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:52:08,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:52:08,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:52:08,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:52:08,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:52:08,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:52:08,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:52:08,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:52:08,779 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:52:08,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:52:08,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:52:08,781 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:52:08,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:52:08,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:52:08,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:52:08,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:52:08,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:52:08,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:52:08,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:52:08,785 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:52:08,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:52:08,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:52:08,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:52:08,787 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:52:08,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:52:08,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:52:08,797 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:52:08,797 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:52:08,797 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:52:08,798 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:52:08,798 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:52:08,798 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:52:08,799 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:52:08,799 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:52:08,799 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:52:08,799 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:52:08,799 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:52:08,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:52:08,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:52:08,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:52:08,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:52:08,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:52:08,800 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:52:08,800 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:52:08,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:52:08,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:52:08,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:52:08,801 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:52:08,801 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:52:08,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:52:08,801 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:52:08,801 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:52:08,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:52:08,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:52:08,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:52:08,802 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:52:08,802 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:52:08,802 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:52:08,802 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:52:08,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:52:08,803 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:52:08,803 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_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 -> 61816a63e70562669051a12493c2c5215c575cb7 [2018-11-23 01:52:08,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:52:08,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:52:08,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:52:08,838 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:52:08,838 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:52:08,839 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1072a_true-unreach-call.c [2018-11-23 01:52:08,884 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/9402e1f9b/90ed97946b4749bfb43785248efc7a7c/FLAG06842fe2f [2018-11-23 01:52:09,226 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:52:09,227 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/sv-benchmarks/c/float-newlib/float_req_bl_1072a_true-unreach-call.c [2018-11-23 01:52:09,232 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/9402e1f9b/90ed97946b4749bfb43785248efc7a7c/FLAG06842fe2f [2018-11-23 01:52:09,241 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/9402e1f9b/90ed97946b4749bfb43785248efc7a7c [2018-11-23 01:52:09,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:52:09,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:52:09,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:09,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:52:09,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:52:09,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a4231f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09, skipping insertion in model container [2018-11-23 01:52:09,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:52:09,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:52:09,381 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:09,383 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:52:09,397 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:09,409 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:52:09,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09 WrapperNode [2018-11-23 01:52:09,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:09,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:09,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:52:09,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:52:09,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:09,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:52:09,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:52:09,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:52:09,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... [2018-11-23 01:52:09,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:52:09,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:52:09,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:52:09,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:52:09,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 01:52:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 01:52:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:52:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 01:52:09,529 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 01:52:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:52:09,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:52:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 01:52:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:52:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:52:09,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:52:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:52:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:52:09,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:52:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_float [2018-11-23 01:52:09,530 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_float [2018-11-23 01:52:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:52:09,720 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:52:09,720 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 01:52:09,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:09 BoogieIcfgContainer [2018-11-23 01:52:09,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:52:09,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:52:09,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:52:09,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:52:09,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:09" (1/3) ... [2018-11-23 01:52:09,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef92d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:09, skipping insertion in model container [2018-11-23 01:52:09,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:09" (2/3) ... [2018-11-23 01:52:09,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef92d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:09, skipping insertion in model container [2018-11-23 01:52:09,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:09" (3/3) ... [2018-11-23 01:52:09,727 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072a_true-unreach-call.c [2018-11-23 01:52:09,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:52:09,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:52:09,757 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:52:09,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:52:09,784 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:52:09,784 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:52:09,784 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:52:09,784 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:52:09,784 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:52:09,784 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:52:09,784 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:52:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 01:52:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 01:52:09,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:52:09,806 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 01:52:09,808 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:52:09,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash -456969478, now seen corresponding path program 1 times [2018-11-23 01:52:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:52:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:52:09,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:52:09,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:52:09,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:52:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:09,917 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 01:52:09,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:52:09,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:52:09,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:52:09,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:52:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:52:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:52:09,935 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 01:52:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:52:09,950 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 01:52:09,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:52:09,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 01:52:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:52:09,957 INFO L225 Difference]: With dead ends: 66 [2018-11-23 01:52:09,957 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 01:52:09,960 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 01:52:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 01:52:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 01:52:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 01:52:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 01:52:09,984 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 24 [2018-11-23 01:52:09,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:52:09,985 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 01:52:09,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:52:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 01:52:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:52:09,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:52:09,985 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 01:52:09,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:52:09,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1810155496, now seen corresponding path program 1 times [2018-11-23 01:52:09,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:52:09,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:52:09,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:52:09,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:52:09,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:52:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:52:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:52:10,061 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450952, |#NULL.offset|=6442450946, |old(#NULL.base)|=6442450952, |old(#NULL.offset)|=6442450946] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450952, |old(#NULL.offset)|=6442450946] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450952, |old(#NULL.offset)|=6442450946] [?] RET #88#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := trunc_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.0] [?] ~x := #in~x;havoc ~signbit~0;havoc ~w~0;havoc ~exponent_less_127~0; VAL [trunc_float_~x=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.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);~w~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 [trunc_float_~w~0=3, trunc_float_~x=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.0] [?] goto; VAL [trunc_float_~w~0=3, trunc_float_~x=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.0] [?] ~signbit~0 := (if ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);~exponent_less_127~0 := ~bitwiseAnd(~w~0, 2139095040) / 8388608 - 127; VAL [trunc_float_~exponent_less_127~0=255, trunc_float_~signbit~0=0, trunc_float_~w~0=3, trunc_float_~x=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.0] [?] assume !(~exponent_less_127~0 < 23); VAL [trunc_float_~exponent_less_127~0=255, trunc_float_~signbit~0=0, trunc_float_~w~0=3, trunc_float_~x=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.0] [?] assume 255 == ~exponent_less_127~0;#res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [trunc_float_~exponent_less_127~0=255, trunc_float_~signbit~0=0, trunc_float_~w~0=3, trunc_float_~x=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.0] [?] assume true; VAL [trunc_float_~exponent_less_127~0=255, trunc_float_~signbit~0=0, trunc_float_~w~0=3, trunc_float_~x=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_float_#in~x|=6442450951.0] [?] RET #92#return; VAL [main_~x~0=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=6442450945.0] [?] ~res~0 := #t~ret8;havoc #t~ret8; VAL [main_~res~0=6442450945.0, main_~x~0=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := isinf_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450945.0] [?] ~x := #in~x;havoc ~ix~0; VAL [isinf_float_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450945.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~mem6 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4);~ix~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union7, ~#gf_u~1.base, ~#gf_u~1.offset, 4);havoc #t~mem6;havoc #t~union7;call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset);havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [isinf_float_~ix~0=(- 2147483648), isinf_float_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450945.0] [?] goto; VAL [isinf_float_~ix~0=(- 2147483648), isinf_float_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450945.0] [?] ~ix~0 := ~bitwiseAnd(~ix~0, 2147483647);#res := (if 2139095040 == ~ix~0 then 1 else 0); VAL [isinf_float_~ix~0=0, isinf_float_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450945.0, |isinf_float_#res|=0] [?] assume true; VAL [isinf_float_~ix~0=0, isinf_float_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450945.0, |isinf_float_#res|=0] [?] RET #94#return; VAL [main_~res~0=6442450945.0, main_~x~0=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=0] [?] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; VAL [main_~res~0=6442450945.0, main_~x~0=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=0] [?] assume 0 == #t~ret9;havoc #t~ret9; VAL [main_~res~0=6442450945.0, main_~x~0=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=6442450945.0, main_~x~0=6442450951.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450952, #NULL.offset=6442450946, old(#NULL.base)=6442450952, old(#NULL.offset)=6442450946] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450952, old(#NULL.offset)=6442450946] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450952, old(#NULL.offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L62] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L63] CALL call #t~ret8 := trunc_float(~x~0); VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0] [L12-L41] ~x := #in~x; [L13] havoc ~signbit~0; [L13] havoc ~w~0; [L13] havoc ~exponent_less_127~0; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450951E9] [L15] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L16] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] ~w~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L17] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] havoc #t~mem0; [L17] havoc #t~union1; [L15] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L15] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~w~0=3, ~x=6.442450951E9] [L19] ~signbit~0 := (if ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L20] ~exponent_less_127~0 := ~bitwiseAnd(~w~0, 2139095040) / 8388608 - 127; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L21-L39] assume !(~exponent_less_127~0 < 23); VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L37-L38] assume 255 == ~exponent_less_127~0; [L38] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L12-L41] ensures true; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L63] RET call #t~ret8 := trunc_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=6.442450945E9, ~x~0=6.442450951E9] [L63] ~res~0 := #t~ret8; [L63] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] CALL call #t~ret9 := isinf_float(~res~0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0] [L44-L53] ~x := #in~x; [L45] havoc ~ix~0; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450945E9] [L47] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L48] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L49] call #t~mem6 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L49] ~ix~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L49] call write~real(#t~union7, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L47] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~ix~0=-2147483648, ~x=6.442450945E9] [L51] ~ix~0 := ~bitwiseAnd(~ix~0, 2147483647); [L52] #res := (if 2139095040 == ~ix~0 then 1 else 0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L44-L53] ensures true; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L66] RET call #t~ret9 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66-L69] assume 0 == #t~ret9; [L66] havoc #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L67] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450952, #NULL.offset=6442450946, old(#NULL.base)=6442450952, old(#NULL.offset)=6442450946] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450952, old(#NULL.offset)=6442450946] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450952, old(#NULL.offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L62] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L63] CALL call #t~ret8 := trunc_float(~x~0); VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0] [L12-L41] ~x := #in~x; [L13] havoc ~signbit~0; [L13] havoc ~w~0; [L13] havoc ~exponent_less_127~0; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450951E9] [L15] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L16] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] ~w~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L17] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] havoc #t~mem0; [L17] havoc #t~union1; [L15] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L15] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~w~0=3, ~x=6.442450951E9] [L19] ~signbit~0 := (if ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L20] ~exponent_less_127~0 := ~bitwiseAnd(~w~0, 2139095040) / 8388608 - 127; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L21-L39] assume !(~exponent_less_127~0 < 23); VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L37-L38] assume 255 == ~exponent_less_127~0; [L38] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L12-L41] ensures true; VAL [#in~x=6.442450951E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L63] RET call #t~ret8 := trunc_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=6.442450945E9, ~x~0=6.442450951E9] [L63] ~res~0 := #t~ret8; [L63] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] CALL call #t~ret9 := isinf_float(~res~0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0] [L44-L53] ~x := #in~x; [L45] havoc ~ix~0; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450945E9] [L47] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L48] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L49] call #t~mem6 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L49] ~ix~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L49] call write~real(#t~union7, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L47] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~ix~0=-2147483648, ~x=6.442450945E9] [L51] ~ix~0 := ~bitwiseAnd(~ix~0, 2147483647); [L52] #res := (if 2139095040 == ~ix~0 then 1 else 0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L44-L53] ensures true; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L66] RET call #t~ret9 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66-L69] assume 0 == #t~ret9; [L66] havoc #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L67] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450952, #NULL!offset=6442450946, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L62] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret8 := trunc_float(~x~0); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0] [L12-L41] ~x := #in~x; [L13] havoc ~signbit~0; [L13] havoc ~w~0; [L13] havoc ~exponent_less_127~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450951E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~mem0; [L17] havoc #t~union1; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~w~0=3, ~x=6.442450951E9] [L19] ~signbit~0 := (if ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L20] ~exponent_less_127~0 := ~bitwiseAnd(~w~0, 2139095040) / 8388608 - 127; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L21] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L37] COND TRUE 255 == ~exponent_less_127~0 [L38] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L63] RET call #t~ret8 := trunc_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450945E9, ~x~0=6.442450951E9] [L63] ~res~0 := #t~ret8; [L63] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] CALL call #t~ret9 := isinf_float(~res~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L44-L53] ~x := #in~x; [L45] havoc ~ix~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L47] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L48] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] FCALL call #t~mem6 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] ~ix~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L49] FCALL call write~real(#t~union7, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L47] havoc ~#gf_u~1; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~ix~0=-2147483648, ~x=6.442450945E9] [L51] ~ix~0 := ~bitwiseAnd(~ix~0, 2147483647); [L52] #res := (if 2139095040 == ~ix~0 then 1 else 0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L66] RET call #t~ret9 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] COND TRUE 0 == #t~ret9 [L66] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L67] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450952, #NULL!offset=6442450946, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L62] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret8 := trunc_float(~x~0); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0] [L12-L41] ~x := #in~x; [L13] havoc ~signbit~0; [L13] havoc ~w~0; [L13] havoc ~exponent_less_127~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450951E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~mem0; [L17] havoc #t~union1; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~w~0=3, ~x=6.442450951E9] [L19] ~signbit~0 := (if ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L20] ~exponent_less_127~0 := ~bitwiseAnd(~w~0, 2139095040) / 8388608 - 127; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L21] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L37] COND TRUE 255 == ~exponent_less_127~0 [L38] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L63] RET call #t~ret8 := trunc_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450945E9, ~x~0=6.442450951E9] [L63] ~res~0 := #t~ret8; [L63] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] CALL call #t~ret9 := isinf_float(~res~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L44-L53] ~x := #in~x; [L45] havoc ~ix~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L47] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L48] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] FCALL call #t~mem6 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] ~ix~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L49] FCALL call write~real(#t~union7, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L47] havoc ~#gf_u~1; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~ix~0=-2147483648, ~x=6.442450945E9] [L51] ~ix~0 := ~bitwiseAnd(~ix~0, 2147483647); [L52] #res := (if 2139095040 == ~ix~0 then 1 else 0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L66] RET call #t~ret9 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] COND TRUE 0 == #t~ret9 [L66] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L67] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450952, #NULL!offset=6442450946, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L62] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret8 := trunc_float(~x~0); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0] [L12-L41] ~x := #in~x; [L13] havoc ~signbit~0; [L13] havoc ~w~0; [L13] havoc ~exponent_less_127~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450951E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~mem0; [L17] havoc #t~union1; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~w~0=3, ~x=6.442450951E9] [L19] ~signbit~0 := (if ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L20] ~exponent_less_127~0 := ~bitwiseAnd(~w~0, 2139095040) / 8388608 - 127; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L21] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L37] COND TRUE 255 == ~exponent_less_127~0 [L38] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L63] RET call #t~ret8 := trunc_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450945E9, ~x~0=6.442450951E9] [L63] ~res~0 := #t~ret8; [L63] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] CALL call #t~ret9 := isinf_float(~res~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L44-L53] ~x := #in~x; [L45] havoc ~ix~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L47] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L48] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] FCALL call #t~mem6 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] ~ix~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L49] FCALL call write~real(#t~union7, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L47] havoc ~#gf_u~1; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~ix~0=-2147483648, ~x=6.442450945E9] [L51] ~ix~0 := ~bitwiseAnd(~ix~0, 2147483647); [L52] #res := (if 2139095040 == ~ix~0 then 1 else 0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L66] RET call #t~ret9 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] COND TRUE 0 == #t~ret9 [L66] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L67] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450952, #NULL!offset=6442450946, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450952, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L62] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret8 := trunc_float(~x~0); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0] [L12-L41] ~x := #in~x; [L13] havoc ~signbit~0; [L13] havoc ~w~0; [L13] havoc ~exponent_less_127~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450951E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~mem0; [L17] havoc #t~union1; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~w~0=3, ~x=6.442450951E9] [L19] ~signbit~0 := (if ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L20] ~exponent_less_127~0 := ~bitwiseAnd(~w~0, 2139095040) / 8388608 - 127; VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L21] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L37] COND TRUE 255 == ~exponent_less_127~0 [L38] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450951E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=255, ~signbit~0=0, ~w~0=3, ~x=6.442450951E9] [L63] RET call #t~ret8 := trunc_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450945E9, ~x~0=6.442450951E9] [L63] ~res~0 := #t~ret8; [L63] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] CALL call #t~ret9 := isinf_float(~res~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L44-L53] ~x := #in~x; [L45] havoc ~ix~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L47] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L48] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] FCALL call #t~mem6 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] ~ix~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L49] FCALL call write~real(#t~union7, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L47] havoc ~#gf_u~1; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~ix~0=-2147483648, ~x=6.442450945E9] [L51] ~ix~0 := ~bitwiseAnd(~ix~0, 2147483647); [L52] #res := (if 2139095040 == ~ix~0 then 1 else 0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~0=0, ~x=6.442450945E9] [L66] RET call #t~ret9 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L66] COND TRUE 0 == #t~ret9 [L66] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L67] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450945E9, ~x~0=6.442450951E9] [L62] float x = 1.0f / 0.0f; [L63] CALL, EXPR trunc_float(x) VAL [\old(x)=6442450951] [L13] __int32_t signbit, w, exponent_less_127; VAL [\old(x)=6442450951, x=6442450951] [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L19] signbit = w & 0x80000000 [L20] exponent_less_127 = ((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=6442450951, exponent_less_127=255, signbit=0, w=3, x=6442450951] [L21] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=6442450951, exponent_less_127=255, signbit=0, w=3, x=6442450951] [L37] COND TRUE exponent_less_127 == 255 [L38] return x + x; VAL [\old(x)=6442450951, exponent_less_127=255, signbit=0, w=3, x=6442450951] [L63] RET, EXPR trunc_float(x) VAL [trunc_float(x)=6442450945, x=6442450951] [L63] float res = trunc_float(x); [L66] CALL, EXPR isinf_float(res) VAL [\old(x)=6442450945] [L45] __int32_t ix; VAL [\old(x)=6442450945, x=6442450945] [L47] ieee_float_shape_type gf_u; [L48] gf_u.value = (x) [L49] EXPR gf_u.word [L49] (ix) = gf_u.word [L51] ix &= 0x7fffffff [L52] return ((ix) == 0x7f800000L); VAL [\old(x)=6442450945, \result=0, ix=0, x=6442450945] [L66] RET, EXPR isinf_float(res) VAL [isinf_float(res)=0, res=6442450945, x=6442450951] [L66] COND TRUE !isinf_float(res) [L67] __VERIFIER_error() VAL [res=6442450945, x=6442450951] ----- [2018-11-23 01:52:10,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:52:10 BoogieIcfgContainer [2018-11-23 01:52:10,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:52:10,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:52:10,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:52:10,102 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:52:10,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:09" (3/4) ... [2018-11-23 01:52:10,106 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:52:10,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:52:10,106 INFO L168 Benchmark]: Toolchain (without parser) took 861.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -101.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:10,107 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:52:10,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.01 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:10,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.42 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:52:10,109 INFO L168 Benchmark]: Boogie Preprocessor took 59.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:10,109 INFO L168 Benchmark]: RCFGBuilder took 235.17 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:10,110 INFO L168 Benchmark]: TraceAbstraction took 380.92 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:10,110 INFO L168 Benchmark]: Witness Printer took 3.55 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 01:52:10,112 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.01 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.42 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.17 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 380.92 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 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: 67]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 38, overapproximation of bitwiseAnd at line 51. Possible FailurePath: [L62] float x = 1.0f / 0.0f; [L63] CALL, EXPR trunc_float(x) VAL [\old(x)=6442450951] [L13] __int32_t signbit, w, exponent_less_127; VAL [\old(x)=6442450951, x=6442450951] [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L19] signbit = w & 0x80000000 [L20] exponent_less_127 = ((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=6442450951, exponent_less_127=255, signbit=0, w=3, x=6442450951] [L21] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=6442450951, exponent_less_127=255, signbit=0, w=3, x=6442450951] [L37] COND TRUE exponent_less_127 == 255 [L38] return x + x; VAL [\old(x)=6442450951, exponent_less_127=255, signbit=0, w=3, x=6442450951] [L63] RET, EXPR trunc_float(x) VAL [trunc_float(x)=6442450945, x=6442450951] [L63] float res = trunc_float(x); [L66] CALL, EXPR isinf_float(res) VAL [\old(x)=6442450945] [L45] __int32_t ix; VAL [\old(x)=6442450945, x=6442450945] [L47] ieee_float_shape_type gf_u; [L48] gf_u.value = (x) [L49] EXPR gf_u.word [L49] (ix) = gf_u.word [L51] ix &= 0x7fffffff [L52] return ((ix) == 0x7f800000L); VAL [\old(x)=6442450945, \result=0, ix=0, x=6442450945] [L66] RET, EXPR isinf_float(res) VAL [isinf_float(res)=0, res=6442450945, x=6442450951] [L66] COND TRUE !isinf_float(res) [L67] __VERIFIER_error() VAL [res=6442450945, x=6442450951] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 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=37occurred 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 01:52:11,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:52:11,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:52:11,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:52:11,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:52:11,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:52:11,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:52:11,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:52:11,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:52:11,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:52:11,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:52:11,528 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:52:11,529 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:52:11,530 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:52:11,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:52:11,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:52:11,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:52:11,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:52:11,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:52:11,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:52:11,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:52:11,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:52:11,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:52:11,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:52:11,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:52:11,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:52:11,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:52:11,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:52:11,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:52:11,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:52:11,542 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:52:11,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:52:11,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:52:11,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:52:11,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:52:11,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:52:11,544 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 01:52:11,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:52:11,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:52:11,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:52:11,556 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:52:11,556 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:52:11,556 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:52:11,556 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:52:11,556 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:52:11,557 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:52:11,557 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:52:11,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:52:11,557 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:52:11,558 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:52:11,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:52:11,559 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:52:11,559 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:52:11,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:52:11,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:52:11,559 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:52:11,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:52:11,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:52:11,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:52:11,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:52:11,560 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:52:11,560 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:52:11,560 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:52:11,560 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:52:11,561 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 01:52:11,561 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_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 -> 61816a63e70562669051a12493c2c5215c575cb7 [2018-11-23 01:52:11,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:52:11,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:52:11,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:52:11,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:52:11,605 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:52:11,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1072a_true-unreach-call.c [2018-11-23 01:52:11,648 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/6955536c5/1f0cc1f97e984603b2875ab088f8990a/FLAGb8b87faed [2018-11-23 01:52:11,970 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:52:11,970 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/sv-benchmarks/c/float-newlib/float_req_bl_1072a_true-unreach-call.c [2018-11-23 01:52:11,974 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/6955536c5/1f0cc1f97e984603b2875ab088f8990a/FLAGb8b87faed [2018-11-23 01:52:12,414 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/data/6955536c5/1f0cc1f97e984603b2875ab088f8990a [2018-11-23 01:52:12,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:52:12,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:52:12,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:12,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:52:12,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:52:12,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2129d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12, skipping insertion in model container [2018-11-23 01:52:12,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:52:12,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:52:12,571 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:12,575 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:52:12,593 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:12,609 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:52:12,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12 WrapperNode [2018-11-23 01:52:12,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:12,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:12,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:52:12,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:52:12,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:12,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:52:12,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:52:12,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:52:12,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... [2018-11-23 01:52:12,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:52:12,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:52:12,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:52:12,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:52:12,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 01:52:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 01:52:12,740 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 01:52:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:52:12,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:52:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:52:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 01:52:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:52:12,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:52:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 01:52:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:52:12,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:52:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_float [2018-11-23 01:52:12,741 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_float [2018-11-23 01:52:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 01:52:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 01:52:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:52:12,939 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:52:12,940 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 01:52:12,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:12 BoogieIcfgContainer [2018-11-23 01:52:12,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:52:12,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:52:12,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:52:12,942 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:52:12,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:12" (1/3) ... [2018-11-23 01:52:12,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3464a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:12, skipping insertion in model container [2018-11-23 01:52:12,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:12" (2/3) ... [2018-11-23 01:52:12,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3464a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:12, skipping insertion in model container [2018-11-23 01:52:12,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:12" (3/3) ... [2018-11-23 01:52:12,945 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072a_true-unreach-call.c [2018-11-23 01:52:12,951 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:52:12,956 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:52:12,965 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:52:12,983 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:52:12,984 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:52:12,984 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:52:12,984 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:52:12,984 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:52:12,984 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:52:12,984 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:52:12,984 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:52:12,984 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:52:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 01:52:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:52:12,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:52:12,998 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 01:52:12,999 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:52:13,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 503658527, now seen corresponding path program 1 times [2018-11-23 01:52:13,005 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:52:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 01:52:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:52:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:13,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:52:13,078 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 01:52:13,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:52:13,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:52:13,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:52:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:52:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:52:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:52:13,103 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 01:52:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:52:13,116 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2018-11-23 01:52:13,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:52:13,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 01:52:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:52:13,123 INFO L225 Difference]: With dead ends: 64 [2018-11-23 01:52:13,123 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:52:13,126 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 01:52:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:52:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 01:52:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 01:52:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 01:52:13,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-11-23 01:52:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:52:13,154 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 01:52:13,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:52:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 01:52:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:52:13,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:52:13,155 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 01:52:13,155 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:52:13,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -723579698, now seen corresponding path program 1 times [2018-11-23 01:52:13,156 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:52:13,156 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 01:52:13,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:52:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:13,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:52:13,337 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 01:52:13,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:52:13,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:52:13,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:52:13,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:52:13,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:52:13,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:52:13,347 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 6 states. [2018-11-23 01:52:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:52:13,536 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 01:52:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:52:13,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 01:52:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:52:13,539 INFO L225 Difference]: With dead ends: 48 [2018-11-23 01:52:13,540 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 01:52:13,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:52:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 01:52:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 01:52:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 01:52:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 01:52:13,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2018-11-23 01:52:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:52:13,547 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 01:52:13,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:52:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 01:52:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:52:13,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:52:13,548 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 01:52:13,549 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:52:13,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1367100721, now seen corresponding path program 1 times [2018-11-23 01:52:13,549 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:52:13,550 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 01:52:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:52:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:13,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:52:13,792 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 01:52:13,793 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:52:13,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:52:13,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:52:13,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:52:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:52:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:52:13,801 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 11 states. [2018-11-23 01:52:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:52:14,159 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 01:52:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:52:14,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 01:52:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:52:14,161 INFO L225 Difference]: With dead ends: 40 [2018-11-23 01:52:14,161 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 01:52:14,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:52:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 01:52:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 01:52:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 01:52:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 01:52:14,168 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2018-11-23 01:52:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:52:14,168 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 01:52:14,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:52:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 01:52:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 01:52:14,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:52:14,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:52:14,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:52:14,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash -69324930, now seen corresponding path program 1 times [2018-11-23 01:52:14,170 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:52:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/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 01:52:14,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:52:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:14,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:52:14,279 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 01:52:14,279 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:52:14,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:52:14,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:52:14,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:52:14,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:52:14,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:52:14,287 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 7 states. [2018-11-23 01:52:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:52:14,468 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 01:52:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:52:14,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-23 01:52:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:52:14,469 INFO L225 Difference]: With dead ends: 31 [2018-11-23 01:52:14,469 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 01:52:14,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:52:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 01:52:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 01:52:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 01:52:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 01:52:14,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-23 01:52:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:52:14,471 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:52:14,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:52:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:52:14,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:52:14,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 01:52:14,590 INFO L451 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 44 53) the Hoare annotation is: true [2018-11-23 01:52:14,590 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 46 50) no Hoare annotation was computed. [2018-11-23 01:52:14,590 INFO L444 ceAbstractionStarter]: At program point L46-2(lines 46 50) the Hoare annotation is: (= |isinf_float_#in~x| isinf_float_~x) [2018-11-23 01:52:14,590 INFO L448 ceAbstractionStarter]: For program point L46-3(lines 46 50) no Hoare annotation was computed. [2018-11-23 01:52:14,590 INFO L448 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 44 53) no Hoare annotation was computed. [2018-11-23 01:52:14,590 INFO L448 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 44 53) no Hoare annotation was computed. [2018-11-23 01:52:14,590 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:52:14,590 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:52:14,590 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:52:14,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:52:14,591 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 01:52:14,591 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:52:14,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:52:14,591 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 66 69) no Hoare annotation was computed. [2018-11-23 01:52:14,591 INFO L444 ceAbstractionStarter]: At program point L63(line 63) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) [2018-11-23 01:52:14,591 INFO L448 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2018-11-23 01:52:14,591 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 55 72) the Hoare annotation is: true [2018-11-23 01:52:14,591 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 55 72) no Hoare annotation was computed. [2018-11-23 01:52:14,591 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2018-11-23 01:52:14,591 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 55 72) no Hoare annotation was computed. [2018-11-23 01:52:14,592 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-23 01:52:14,592 INFO L444 ceAbstractionStarter]: At program point L66(line 66) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (and (= main_~res~0 .cse0) (= main_~x~0 .cse0))) [2018-11-23 01:52:14,592 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 39) no Hoare annotation was computed. [2018-11-23 01:52:14,593 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 39) no Hoare annotation was computed. [2018-11-23 01:52:14,593 INFO L451 ceAbstractionStarter]: At program point trunc_floatENTRY(lines 12 41) the Hoare annotation is: true [2018-11-23 01:52:14,593 INFO L448 ceAbstractionStarter]: For program point trunc_floatEXIT(lines 12 41) no Hoare annotation was computed. [2018-11-23 01:52:14,593 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-11-23 01:52:14,593 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 30 34) the Hoare annotation is: (and (= trunc_float_~x |trunc_float_#in~x|) (exists ((trunc_float_~w~0 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) trunc_float_~w~0) ((_ extract 30 23) trunc_float_~w~0) ((_ extract 22 0) trunc_float_~w~0)) |trunc_float_#in~x|) (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))) (exists ((trunc_float_~w~0 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) trunc_float_~w~0) ((_ extract 30 23) trunc_float_~w~0) ((_ extract 22 0) trunc_float_~w~0)) |trunc_float_#in~x|) (= (bvadd (bvashr (bvand (_ bv2139095040 32) trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) trunc_float_~exponent_less_127~0))) (= (fp ((_ extract 31 31) trunc_float_~w~0) ((_ extract 30 23) trunc_float_~w~0) ((_ extract 22 0) trunc_float_~w~0)) |trunc_float_#in~x|)) [2018-11-23 01:52:14,593 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 24 28) no Hoare annotation was computed. [2018-11-23 01:52:14,593 INFO L448 ceAbstractionStarter]: For program point trunc_floatFINAL(lines 12 41) no Hoare annotation was computed. [2018-11-23 01:52:14,593 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 35) no Hoare annotation was computed. [2018-11-23 01:52:14,594 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 28) the Hoare annotation is: (and (= trunc_float_~x |trunc_float_#in~x|) (exists ((trunc_float_~w~0 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) trunc_float_~w~0) ((_ extract 30 23) trunc_float_~w~0) ((_ extract 22 0) trunc_float_~w~0)) |trunc_float_#in~x|) (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))) (exists ((trunc_float_~w~0 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) trunc_float_~w~0) ((_ extract 30 23) trunc_float_~w~0) ((_ extract 22 0) trunc_float_~w~0)) |trunc_float_#in~x|) (= (bvadd (bvashr (bvand (_ bv2139095040 32) trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) trunc_float_~exponent_less_127~0))) (= (fp ((_ extract 31 31) trunc_float_~w~0) ((_ extract 30 23) trunc_float_~w~0) ((_ extract 22 0) trunc_float_~w~0)) |trunc_float_#in~x|)) [2018-11-23 01:52:14,594 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2018-11-23 01:52:14,594 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 18) the Hoare annotation is: (= trunc_float_~x |trunc_float_#in~x|) [2018-11-23 01:52:14,594 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 14 18) no Hoare annotation was computed. [2018-11-23 01:52:14,594 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2018-11-23 01:52:14,599 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:52:14 BoogieIcfgContainer [2018-11-23 01:52:14,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:52:14,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:52:14,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:52:14,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:52:14,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:12" (3/4) ... [2018-11-23 01:52:14,619 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:52:14,623 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-11-23 01:52:14,623 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 01:52:14,623 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 01:52:14,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure trunc_float [2018-11-23 01:52:14,627 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-23 01:52:14,628 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 01:52:14,628 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 01:52:14,648 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 01:52:14,648 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 01:52:14,649 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvslt32(~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32), 23bv32))) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == \old(x) [2018-11-23 01:52:14,649 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvslt32(~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32), 23bv32))) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == \old(x) [2018-11-23 01:52:14,667 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2981c8b8-82d7-43af-9ff0-7148b0b0ef1f/bin-2019/utaipan/witness.graphml [2018-11-23 01:52:14,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:52:14,668 INFO L168 Benchmark]: Toolchain (without parser) took 2251.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 949.7 MB in the beginning and 967.1 MB in the end (delta: -17.3 MB). Peak memory consumption was 133.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:14,669 INFO L168 Benchmark]: CDTParser took 0.15 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 01:52:14,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.28 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 01:52:14,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.28 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 01:52:14,670 INFO L168 Benchmark]: Boogie Preprocessor took 27.45 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 01:52:14,671 INFO L168 Benchmark]: RCFGBuilder took 286.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:14,671 INFO L168 Benchmark]: TraceAbstraction took 1674.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.1 MB in the end (delta: 154.5 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:14,671 INFO L168 Benchmark]: Witness Printer took 52.77 ms. Allocated memory is still 1.2 GB. Free memory is still 967.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:52:14,673 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.15 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 191.28 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 15.28 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 27.45 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. * RCFGBuilder took 286.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1674.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.1 MB in the end (delta: 154.5 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. * Witness Printer took 52.77 ms. Allocated memory is still 1.2 GB. Free memory is still 967.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 67]: 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: 24]: Loop Invariant [2018-11-23 01:52:14,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvslt32(~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32), 23bv32))) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == \old(x) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 30]: Loop Invariant [2018-11-23 01:52:14,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,682 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,682 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,682 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,682 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] [2018-11-23 01:52:14,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[trunc_float_~w~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvslt32(~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32), 23bv32))) && (\exists trunc_float_~w~0 : bv32 :: ~fp~LONGDOUBLE(trunc_float_~w~0[31:31], trunc_float_~w~0[30:23], trunc_float_~w~0[22:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == \old(x) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 74 SDslu, 320 SDs, 0 SdLazy, 135 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 18 PreInvPairs, 23 NumberOfFragments, 143 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 11 QuantifiedInterpolants, 11867 SizeOfPredicates, 12 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 26 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...