./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1092d_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_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1092d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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 b88866a66e040da6249cd5acf77993c03d3c500f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1092d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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 b88866a66e040da6249cd5acf77993c03d3c500f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:26:16,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:26:16,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:26:16,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:26:16,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:26:16,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:26:16,812 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:26:16,814 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:26:16,815 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:26:16,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:26:16,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:26:16,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:26:16,817 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:26:16,818 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:26:16,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:26:16,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:26:16,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:26:16,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:26:16,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:26:16,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:26:16,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:26:16,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:26:16,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:26:16,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:26:16,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:26:16,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:26:16,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:26:16,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:26:16,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:26:16,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:26:16,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:26:16,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:26:16,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:26:16,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:26:16,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:26:16,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:26:16,833 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 22:26:16,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:26:16,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:26:16,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:26:16,845 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:26:16,845 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:26:16,845 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:26:16,845 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:26:16,845 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 22:26:16,845 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:26:16,846 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:26:16,846 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 22:26:16,846 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 22:26:16,846 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:26:16,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:26:16,847 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:26:16,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:26:16,847 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:26:16,847 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:26:16,847 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:26:16,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:26:16,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:26:16,848 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:26:16,848 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:26:16,848 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:26:16,848 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:26:16,848 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:26:16,848 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:26:16,849 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:26:16,849 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:26:16,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:26:16,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:26:16,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:26:16,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:26:16,849 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 22:26:16,850 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:26:16,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:26:16,850 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 22:26:16,850 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_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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 -> b88866a66e040da6249cd5acf77993c03d3c500f [2018-11-22 22:26:16,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:26:16,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:26:16,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:26:16,887 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:26:16,887 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:26:16,888 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1092d_true-unreach-call.c [2018-11-22 22:26:16,926 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/9233bc26f/d0bd602fe15b458b8aee7eb9c59ae8cc/FLAG58eb11312 [2018-11-22 22:26:17,270 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:26:17,270 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/sv-benchmarks/c/float-newlib/float_req_bl_1092d_true-unreach-call.c [2018-11-22 22:26:17,275 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/9233bc26f/d0bd602fe15b458b8aee7eb9c59ae8cc/FLAG58eb11312 [2018-11-22 22:26:17,688 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/9233bc26f/d0bd602fe15b458b8aee7eb9c59ae8cc [2018-11-22 22:26:17,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:26:17,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:26:17,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:26:17,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:26:17,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:26:17,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc3843d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17, skipping insertion in model container [2018-11-22 22:26:17,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:26:17,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:26:17,838 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:26:17,840 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:26:17,856 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:26:17,869 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:26:17,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17 WrapperNode [2018-11-22 22:26:17,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:26:17,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:26:17,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:26:17,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:26:17,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:26:17,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:26:17,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:26:17,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:26:17,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... [2018-11-22 22:26:17,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:26:17,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:26:17,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:26:17,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:26:17,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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-22 22:26:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-22 22:26:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:26:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-22 22:26:17,993 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-22 22:26:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:26:17,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:26:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 22:26:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:26:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:26:17,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:26:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:26:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:26:17,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:26:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_float [2018-11-22 22:26:17,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_float [2018-11-22 22:26:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:26:18,178 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:26:18,179 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-22 22:26:18,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:26:18 BoogieIcfgContainer [2018-11-22 22:26:18,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:26:18,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:26:18,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:26:18,183 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:26:18,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:26:17" (1/3) ... [2018-11-22 22:26:18,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d00e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:26:18, skipping insertion in model container [2018-11-22 22:26:18,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:17" (2/3) ... [2018-11-22 22:26:18,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d00e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:26:18, skipping insertion in model container [2018-11-22 22:26:18,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:26:18" (3/3) ... [2018-11-22 22:26:18,185 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092d_true-unreach-call.c [2018-11-22 22:26:18,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:26:18,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:26:18,212 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:26:18,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:26:18,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:26:18,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:26:18,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:26:18,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:26:18,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:26:18,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:26:18,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:26:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-22 22:26:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 22:26:18,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:26:18,256 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-22 22:26:18,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:26:18,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:26:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash -104285294, now seen corresponding path program 1 times [2018-11-22 22:26:18,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:26:18,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:26:18,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:26:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:26:18,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:26:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:26:18,361 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-22 22:26:18,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:26:18,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:26:18,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:26:18,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 22:26:18,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:26:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:26:18,383 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-22 22:26:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:26:18,398 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2018-11-22 22:26:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:26:18,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-22 22:26:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:26:18,405 INFO L225 Difference]: With dead ends: 76 [2018-11-22 22:26:18,405 INFO L226 Difference]: Without dead ends: 38 [2018-11-22 22:26:18,407 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-22 22:26:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-22 22:26:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-22 22:26:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 22:26:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-22 22:26:18,432 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 24 [2018-11-22 22:26:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:26:18,433 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-22 22:26:18,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 22:26:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-22 22:26:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 22:26:18,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:26:18,434 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-22 22:26:18,434 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:26:18,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:26:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1628048040, now seen corresponding path program 1 times [2018-11-22 22:26:18,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:26:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:26:18,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:26:18,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:26:18,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:26:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:26:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:26:18,523 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450953, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450945, |old(~huge_ceil~0)|=6442450949.0, ~huge_ceil~0=6442450949.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_ceil~0 := 1.0E30; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450945, |old(~huge_ceil~0)|=6442450949.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450945, |old(~huge_ceil~0)|=6442450949.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] RET #108#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] CALL call #t~ret6 := ceil_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~j0~0;havoc ~i~0;havoc ~ix~0; VAL [ceil_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] goto; VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647);~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !(~j0~0 < 23); VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !(~ix~0 % 4294967296 < 2139095040);#res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume true; VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] RET #112#return; VAL [main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=6442450948.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~res~0 := #t~ret6;havoc #t~ret6; VAL [main_~res~0=6442450948.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] CALL call #t~ret7 := isinf_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450948.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~ix~1; VAL [isinf_float_~x=6442450948.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450948.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4);call #t~mem4 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4);~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union5, ~#gf_u~1.base, ~#gf_u~1.offset, 4);havoc #t~mem4;havoc #t~union5;call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset);havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [isinf_float_~ix~1=3, isinf_float_~x=6442450948.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450948.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] goto; VAL [isinf_float_~ix~1=3, isinf_float_~x=6442450948.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450948.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647);#res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [isinf_float_~ix~1=0, isinf_float_~x=6442450948.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450948.0, |isinf_float_#res|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume true; VAL [isinf_float_~ix~1=0, isinf_float_~x=6442450948.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=6442450948.0, |isinf_float_#res|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] RET #114#return; VAL [main_~res~0=6442450948.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [main_~res~0=6442450948.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume 0 == #t~ret7;havoc #t~ret7; VAL [main_~res~0=6442450948.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=6442450948.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450953, #NULL.offset=6442450945, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=6.442450949E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450952E9] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L13-L54] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450948E9, ~huge_ceil~0=1.0E30, ~x~0=6.442450952E9] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450948E9] [L60] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L61] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] call #t~mem4 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] call write~real(#t~union5, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] havoc #t~mem4; [L62] havoc #t~union5; [L60] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L60] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~ix~1=3, ~x=6.442450948E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L57-L66] ensures true; VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L80] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80-L83] assume 0 == #t~ret7; [L80] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L81] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450953, #NULL.offset=6442450945, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=6.442450949E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450952E9] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L13-L54] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450948E9, ~huge_ceil~0=1.0E30, ~x~0=6.442450952E9] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450948E9] [L60] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L61] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] call #t~mem4 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] call write~real(#t~union5, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L62] havoc #t~mem4; [L62] havoc #t~union5; [L60] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L60] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~ix~1=3, ~x=6.442450948E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L57-L66] ensures true; VAL [#in~x=6.442450948E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L80] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80-L83] assume 0 == #t~ret7; [L80] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L81] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=6.442450949E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450948E9, ~huge_ceil~0=1.0E30, ~x~0=6.442450952E9] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450948E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~mem4; [L62] havoc #t~union5; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~ix~1=3, ~x=6.442450948E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L80] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] COND TRUE 0 == #t~ret7 [L80] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=6.442450949E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450948E9, ~huge_ceil~0=1.0E30, ~x~0=6.442450952E9] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450948E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~mem4; [L62] havoc #t~union5; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~ix~1=3, ~x=6.442450948E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L80] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] COND TRUE 0 == #t~ret7 [L80] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=6.442450949E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450948E9, ~huge_ceil~0=1.0E30, ~x~0=6.442450952E9] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450948E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~mem4; [L62] havoc #t~union5; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~ix~1=3, ~x=6.442450948E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L80] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] COND TRUE 0 == #t~ret7 [L80] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450945, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=6.442450949E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450949E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450948E9, ~huge_ceil~0=1.0E30, ~x~0=6.442450952E9] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] CALL call #t~ret7 := isinf_float(~res~0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L57-L66] ~x := #in~x; [L58] havoc ~ix~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=6.442450948E9] [L60] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L61] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] FCALL call #t~mem4 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] ~ix~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L62] FCALL call write~real(#t~union5, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L62] havoc #t~mem4; [L62] havoc #t~union5; [L60] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L60] havoc ~#gf_u~1; VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~ix~1=3, ~x=6.442450948E9] [L64] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L65] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=6.442450948E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E30, ~ix~1=0, ~x=6.442450948E9] [L80] RET call #t~ret7 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L80] COND TRUE 0 == #t~ret7 [L80] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450948E9, ~x~0=6.442450952E9] [L11] static const float huge_ceil = 1.0e30; VAL [\old(huge_ceil)=6442450949, huge_ceil=1000000000000000000000000000000] [L76] float x = -1.0f / 0.0f; VAL [huge_ceil=1000000000000000000000000000000] [L77] CALL, EXPR ceil_float(x) VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, x=6442450952] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L77] RET, EXPR ceil_float(x) VAL [ceil_float(x)=6442450948, huge_ceil=1000000000000000000000000000000, x=6442450952] [L77] float res = ceil_float(x); [L80] CALL, EXPR isinf_float(res) VAL [\old(x)=6442450948, huge_ceil=1000000000000000000000000000000] [L58] __int32_t ix; VAL [\old(x)=6442450948, huge_ceil=1000000000000000000000000000000, x=6442450948] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (ix) = gf_u.word [L64] ix &= 0x7fffffff [L65] return ((ix) == 0x7f800000L); VAL [\old(x)=6442450948, \result=0, huge_ceil=1000000000000000000000000000000, ix=0, x=6442450948] [L80] RET, EXPR isinf_float(res) VAL [huge_ceil=1000000000000000000000000000000, isinf_float(res)=0, res=6442450948, x=6442450952] [L80] COND TRUE !isinf_float(res) [L81] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000, res=6442450948, x=6442450952] ----- [2018-11-22 22:26:18,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:26:18 BoogieIcfgContainer [2018-11-22 22:26:18,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:26:18,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:26:18,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:26:18,566 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:26:18,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:26:18" (3/4) ... [2018-11-22 22:26:18,569 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:26:18,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:26:18,569 INFO L168 Benchmark]: Toolchain (without parser) took 878.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:18,571 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:26:18,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:18,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.63 ms. Allocated memory is still 1.0 GB. Free memory is still 944.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:26:18,572 INFO L168 Benchmark]: Boogie Preprocessor took 67.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:18,572 INFO L168 Benchmark]: RCFGBuilder took 224.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:18,572 INFO L168 Benchmark]: TraceAbstraction took 385.69 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:18,573 INFO L168 Benchmark]: Witness Printer took 3.07 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-22 22:26:18,575 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.63 ms. Allocated memory is still 1.0 GB. Free memory is still 944.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 385.69 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.07 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: 81]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 44, overapproximation of bitwiseAnd at line 64. Possible FailurePath: [L11] static const float huge_ceil = 1.0e30; VAL [\old(huge_ceil)=6442450949, huge_ceil=1000000000000000000000000000000] [L76] float x = -1.0f / 0.0f; VAL [huge_ceil=1000000000000000000000000000000] [L77] CALL, EXPR ceil_float(x) VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, x=6442450952] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=6442450952, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L77] RET, EXPR ceil_float(x) VAL [ceil_float(x)=6442450948, huge_ceil=1000000000000000000000000000000, x=6442450952] [L77] float res = ceil_float(x); [L80] CALL, EXPR isinf_float(res) VAL [\old(x)=6442450948, huge_ceil=1000000000000000000000000000000] [L58] __int32_t ix; VAL [\old(x)=6442450948, huge_ceil=1000000000000000000000000000000, x=6442450948] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (ix) = gf_u.word [L64] ix &= 0x7fffffff [L65] return ((ix) == 0x7f800000L); VAL [\old(x)=6442450948, \result=0, huge_ceil=1000000000000000000000000000000, ix=0, x=6442450948] [L80] RET, EXPR isinf_float(res) VAL [huge_ceil=1000000000000000000000000000000, isinf_float(res)=0, res=6442450948, x=6442450952] [L80] COND TRUE !isinf_float(res) [L81] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000, res=6442450948, x=6442450952] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 50 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-22 22:26:20,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:26:20,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:26:20,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:26:20,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:26:20,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:26:20,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:26:20,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:26:20,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:26:20,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:26:20,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:26:20,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:26:20,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:26:20,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:26:20,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:26:20,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:26:20,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:26:20,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:26:20,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:26:20,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:26:20,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:26:20,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:26:20,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:26:20,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:26:20,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:26:20,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:26:20,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:26:20,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:26:20,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:26:20,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:26:20,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:26:20,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:26:20,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:26:20,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:26:20,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:26:20,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:26:20,071 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-22 22:26:20,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:26:20,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:26:20,084 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:26:20,084 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:26:20,084 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:26:20,085 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:26:20,085 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:26:20,085 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:26:20,085 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:26:20,085 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:26:20,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:26:20,086 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:26:20,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:26:20,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:26:20,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:26:20,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:26:20,086 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:26:20,087 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 22:26:20,087 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 22:26:20,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:26:20,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:26:20,087 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:26:20,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:26:20,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:26:20,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:26:20,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:26:20,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:26:20,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:26:20,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:26:20,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:26:20,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:26:20,088 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-22 22:26:20,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:26:20,089 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 22:26:20,089 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 22:26:20,089 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_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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 -> b88866a66e040da6249cd5acf77993c03d3c500f [2018-11-22 22:26:20,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:26:20,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:26:20,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:26:20,130 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:26:20,131 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:26:20,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1092d_true-unreach-call.c [2018-11-22 22:26:20,169 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/a336019c5/105357f33b1e4dfabdba83817dc6fb71/FLAG519afc164 [2018-11-22 22:26:20,483 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:26:20,484 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/sv-benchmarks/c/float-newlib/float_req_bl_1092d_true-unreach-call.c [2018-11-22 22:26:20,488 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/a336019c5/105357f33b1e4dfabdba83817dc6fb71/FLAG519afc164 [2018-11-22 22:26:20,496 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/data/a336019c5/105357f33b1e4dfabdba83817dc6fb71 [2018-11-22 22:26:20,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:26:20,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:26:20,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:26:20,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:26:20,503 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:26:20,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567d81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20, skipping insertion in model container [2018-11-22 22:26:20,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:26:20,533 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:26:20,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:26:20,681 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:26:20,704 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:26:20,721 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:26:20,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20 WrapperNode [2018-11-22 22:26:20,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:26:20,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:26:20,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:26:20,722 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:26:20,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:26:20,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:26:20,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:26:20,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:26:20,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... [2018-11-22 22:26:20,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:26:20,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:26:20,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:26:20,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:26:20,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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-22 22:26:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-22 22:26:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-22 22:26:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:26:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:26:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:26:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 22:26:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:26:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:26:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-22 22:26:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:26:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:26:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_float [2018-11-22 22:26:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_float [2018-11-22 22:26:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-22 22:26:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-22 22:26:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:26:21,380 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:26:21,380 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-22 22:26:21,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:26:21 BoogieIcfgContainer [2018-11-22 22:26:21,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:26:21,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:26:21,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:26:21,384 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:26:21,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:26:20" (1/3) ... [2018-11-22 22:26:21,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b90c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:26:21, skipping insertion in model container [2018-11-22 22:26:21,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:26:20" (2/3) ... [2018-11-22 22:26:21,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b90c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:26:21, skipping insertion in model container [2018-11-22 22:26:21,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:26:21" (3/3) ... [2018-11-22 22:26:21,387 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092d_true-unreach-call.c [2018-11-22 22:26:21,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:26:21,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:26:21,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:26:21,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:26:21,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:26:21,434 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:26:21,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:26:21,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:26:21,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:26:21,434 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:26:21,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:26:21,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:26:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-22 22:26:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 22:26:21,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:26:21,453 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-22 22:26:21,455 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:26:21,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:26:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash -731890553, now seen corresponding path program 1 times [2018-11-22 22:26:21,461 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:26:21,461 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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-22 22:26:21,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:26:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:26:21,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:26:21,540 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-22 22:26:21,541 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:26:21,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:26:21,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:26:21,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 22:26:21,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:26:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:26:21,566 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-22 22:26:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:26:21,582 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2018-11-22 22:26:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:26:21,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-22 22:26:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:26:21,591 INFO L225 Difference]: With dead ends: 74 [2018-11-22 22:26:21,591 INFO L226 Difference]: Without dead ends: 37 [2018-11-22 22:26:21,594 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-22 22:26:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-22 22:26:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-22 22:26:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 22:26:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-22 22:26:21,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 23 [2018-11-22 22:26:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:26:21,624 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-22 22:26:21,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 22:26:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-22 22:26:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 22:26:21,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:26:21,625 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-22 22:26:21,625 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:26:21,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:26:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1388678818, now seen corresponding path program 1 times [2018-11-22 22:26:21,626 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:26:21,626 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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-22 22:26:21,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:26:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:26:21,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:26:22,400 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-22 22:26:22,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:26:22,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:26:22,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-22 22:26:22,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 22:26:22,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 22:26:22,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-22 22:26:22,415 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2018-11-22 22:26:22,956 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-22 22:26:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:26:24,346 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-22 22:26:24,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:26:24,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-22 22:26:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:26:24,349 INFO L225 Difference]: With dead ends: 46 [2018-11-22 22:26:24,349 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:26:24,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:26:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:26:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-22 22:26:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 22:26:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-22 22:26:24,357 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2018-11-22 22:26:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:26:24,358 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-22 22:26:24,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 22:26:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-22 22:26:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 22:26:24,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:26:24,360 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-22 22:26:24,361 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:26:24,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:26:24,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1682081825, now seen corresponding path program 1 times [2018-11-22 22:26:24,362 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:26:24,362 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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-22 22:26:24,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:26:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:26:24,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:26:24,508 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-22 22:26:24,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:26:24,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:26:24,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 22:26:24,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 22:26:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:26:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:26:24,526 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 7 states. [2018-11-22 22:26:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:26:25,240 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-22 22:26:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:26:25,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-22 22:26:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:26:25,242 INFO L225 Difference]: With dead ends: 59 [2018-11-22 22:26:25,242 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 22:26:25,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-22 22:26:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 22:26:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-11-22 22:26:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:26:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-22 22:26:25,248 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2018-11-22 22:26:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:26:25,248 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-22 22:26:25,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 22:26:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-22 22:26:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 22:26:25,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:26:25,249 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-22 22:26:25,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:26:25,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:26:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2087457071, now seen corresponding path program 1 times [2018-11-22 22:26:25,250 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:26:25,250 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/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-22 22:26:25,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:26:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:26:25,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:26:25,364 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-22 22:26:25,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:26:25,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:26:25,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 22:26:25,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 22:26:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:26:25,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:26:25,375 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2018-11-22 22:26:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:26:26,010 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-22 22:26:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:26:26,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-22 22:26:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:26:26,011 INFO L225 Difference]: With dead ends: 42 [2018-11-22 22:26:26,011 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 22:26:26,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:26:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 22:26:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 22:26:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 22:26:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 22:26:26,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-22 22:26:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:26:26,013 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:26:26,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 22:26:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:26:26,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 22:26:26,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 22:26:26,078 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2018-11-22 22:26:26,078 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 59 63) the Hoare annotation is: (= |isinf_float_#in~x| isinf_float_~x) [2018-11-22 22:26:26,078 INFO L448 ceAbstractionStarter]: For program point L59-3(lines 59 63) no Hoare annotation was computed. [2018-11-22 22:26:26,079 INFO L451 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 57 66) the Hoare annotation is: true [2018-11-22 22:26:26,079 INFO L448 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 57 66) no Hoare annotation was computed. [2018-11-22 22:26:26,079 INFO L448 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 57 66) no Hoare annotation was computed. [2018-11-22 22:26:26,079 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:26:26,079 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:26:26,079 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:26:26,079 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:26:26,079 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 22:26:26,080 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:26:26,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:26:26,080 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-22 22:26:26,080 INFO L444 ceAbstractionStarter]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse0) main_~res~0) (= main_~x~0 .cse0))) [2018-11-22 22:26:26,080 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2018-11-22 22:26:26,080 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 80 83) no Hoare annotation was computed. [2018-11-22 22:26:26,080 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 68 86) the Hoare annotation is: true [2018-11-22 22:26:26,081 INFO L444 ceAbstractionStarter]: At program point L77(line 77) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 68 86) no Hoare annotation was computed. [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point L77-1(line 77) no Hoare annotation was computed. [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 68 86) no Hoare annotation was computed. [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 47) no Hoare annotation was computed. [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 52) no Hoare annotation was computed. [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 13 54) no Hoare annotation was computed. [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point L48-2(lines 48 52) no Hoare annotation was computed. [2018-11-22 22:26:26,081 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-22 22:26:26,082 INFO L451 ceAbstractionStarter]: At program point ceil_floatENTRY(lines 13 54) the Hoare annotation is: true [2018-11-22 22:26:26,082 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2018-11-22 22:26:26,082 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 41) no Hoare annotation was computed. [2018-11-22 22:26:26,082 INFO L448 ceAbstractionStarter]: For program point ceil_floatFINAL(lines 13 54) no Hoare annotation was computed. [2018-11-22 22:26:26,082 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2018-11-22 22:26:26,082 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 20) the Hoare annotation is: (= |ceil_float_#in~x| ceil_float_~x) [2018-11-22 22:26:26,082 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2018-11-22 22:26:26,082 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2018-11-22 22:26:26,082 INFO L448 ceAbstractionStarter]: For program point ceil_floatEXIT(lines 13 54) no Hoare annotation was computed. [2018-11-22 22:26:26,083 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 38) no Hoare annotation was computed. [2018-11-22 22:26:26,083 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-11-22 22:26:26,083 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 35) no Hoare annotation was computed. [2018-11-22 22:26:26,083 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-22 22:26:26,083 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 46) no Hoare annotation was computed. [2018-11-22 22:26:26,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:26:26 BoogieIcfgContainer [2018-11-22 22:26:26,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:26:26,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:26:26,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:26:26,095 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:26:26,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:26:21" (3/4) ... [2018-11-22 22:26:26,100 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 22:26:26,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-11-22 22:26:26,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 22:26:26,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 22:26:26,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ceil_float [2018-11-22 22:26:26,111 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-22 22:26:26,111 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-22 22:26:26,112 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 22:26:26,137 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-22 22:26:26,137 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-22 22:26:26,159 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_002d3f62-cb1d-4c52-9f61-bfac43ed1f5c/bin-2019/utaipan/witness.graphml [2018-11-22 22:26:26,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:26:26,160 INFO L168 Benchmark]: Toolchain (without parser) took 5661.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.2 MB in the beginning and 909.3 MB in the end (delta: 35.9 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:26,161 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:26:26,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.55 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 927.7 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:26,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.22 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:26:26,161 INFO L168 Benchmark]: Boogie Preprocessor took 78.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:26,162 INFO L168 Benchmark]: RCFGBuilder took 561.90 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-22 22:26:26,162 INFO L168 Benchmark]: TraceAbstraction took 4713.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.1 MB in the end (delta: 171.1 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:26,163 INFO L168 Benchmark]: Witness Printer took 64.76 ms. Allocated memory is still 1.2 GB. Free memory was 916.1 MB in the beginning and 909.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:26:26,165 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 221.55 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 927.7 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.22 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 561.90 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 4713.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.1 MB in the end (delta: 171.1 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.76 ms. Allocated memory is still 1.2 GB. Free memory was 916.1 MB in the beginning and 909.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 119 SDtfs, 163 SDslu, 393 SDs, 0 SdLazy, 262 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 16 PreInvPairs, 19 NumberOfFragments, 49 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 95 ConstructedInterpolants, 11 QuantifiedInterpolants, 11478 SizeOfPredicates, 14 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...