./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cdfpl/square_1_false-unreach-call_true-termination.i --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_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/square_1_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/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 9b4984d971b5a5a3b565edf502e7d7464558f166 ......................................................................................................................................................................................................................................................................................................................................................................... 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_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/square_1_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/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 9b4984d971b5a5a3b565edf502e7d7464558f166 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:02:15,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:02:15,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:02:15,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:02:15,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:02:15,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:02:15,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:02:15,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:02:15,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:02:15,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:02:15,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:02:15,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:02:15,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:02:15,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:02:15,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:02:15,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:02:15,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:02:15,750 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:02:15,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:02:15,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:02:15,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:02:15,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:02:15,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:02:15,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:02:15,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:02:15,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:02:15,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:02:15,757 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:02:15,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:02:15,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:02:15,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:02:15,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:02:15,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:02:15,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:02:15,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:02:15,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:02:15,761 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:02:15,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:02:15,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:02:15,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:02:15,771 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:02:15,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:02:15,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:02:15,771 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:02:15,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:02:15,772 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:02:15,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:02:15,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:02:15,772 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:02:15,772 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:02:15,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:02:15,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:02:15,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:02:15,774 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:02:15,774 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:02:15,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:02:15,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:02:15,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:02:15,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:02:15,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:02:15,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:02:15,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:02:15,775 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:02:15,775 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:02:15,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:02:15,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:02:15,775 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:02:15,775 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_9ef96f69-1524-4765-909a-fa8a1e1ce09a/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 -> 9b4984d971b5a5a3b565edf502e7d7464558f166 [2018-11-23 14:02:15,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:02:15,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:02:15,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:02:15,815 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:02:15,815 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:02:15,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/../../sv-benchmarks/c/floats-cdfpl/square_1_false-unreach-call_true-termination.i [2018-11-23 14:02:15,859 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/a318b571c/524ab9f4e5f349dc9bc89736adb0fa31/FLAGd275250d0 [2018-11-23 14:02:16,248 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:02:16,248 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/sv-benchmarks/c/floats-cdfpl/square_1_false-unreach-call_true-termination.i [2018-11-23 14:02:16,252 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/a318b571c/524ab9f4e5f349dc9bc89736adb0fa31/FLAGd275250d0 [2018-11-23 14:02:16,260 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/a318b571c/524ab9f4e5f349dc9bc89736adb0fa31 [2018-11-23 14:02:16,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:02:16,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:02:16,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:02:16,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:02:16,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:02:16,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e45308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16, skipping insertion in model container [2018-11-23 14:02:16,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:02:16,286 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:02:16,392 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:02:16,394 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:02:16,403 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:02:16,412 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:02:16,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16 WrapperNode [2018-11-23 14:02:16,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:02:16,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:02:16,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:02:16,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:02:16,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:02:16,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:02:16,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:02:16,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:02:16,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... [2018-11-23 14:02:16,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:02:16,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:02:16,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:02:16,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:02:16,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:02:16,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:02:16,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:02:16,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:02:16,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:02:16,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:02:16,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:02:16,608 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:02:16,608 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 14:02:16,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:16 BoogieIcfgContainer [2018-11-23 14:02:16,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:02:16,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:02:16,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:02:16,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:02:16,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:02:16" (1/3) ... [2018-11-23 14:02:16,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57331e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:02:16, skipping insertion in model container [2018-11-23 14:02:16,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:16" (2/3) ... [2018-11-23 14:02:16,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57331e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:02:16, skipping insertion in model container [2018-11-23 14:02:16,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:16" (3/3) ... [2018-11-23 14:02:16,614 INFO L112 eAbstractionObserver]: Analyzing ICFG square_1_false-unreach-call_true-termination.i [2018-11-23 14:02:16,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:02:16,628 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:02:16,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:02:16,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:02:16,666 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:02:16,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:02:16,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:02:16,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:02:16,666 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:02:16,666 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:02:16,666 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:02:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-11-23 14:02:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:02:16,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:02:16,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:02:16,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:02:16,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2109216782, now seen corresponding path program 1 times [2018-11-23 14:02:16,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:02:16,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:16,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:16,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:16,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:02:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:16,768 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #16#return; [?] CALL call #t~ret2 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0);~x~0 := ~IN~0;~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0)); VAL [main_~IN~0=0.0, main_~x~0=0.0] [?] assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39)); VAL [main_~IN~0=0.0, main_~x~0=0.0] [?] assume !false; VAL [main_~IN~0=0.0, main_~x~0=0.0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=0.0, ~x~0=0.0] [L14-L15] assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39)); VAL [~IN~0=0.0, ~x~0=0.0] [L15] assert false; VAL [~IN~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=0.0, ~x~0=0.0] [L14-L15] assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39)); VAL [~IN~0=0.0, ~x~0=0.0] [L15] assert false; VAL [~IN~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=0.0, ~x~0=0.0] [L14] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39)) VAL [~IN~0=0.0, ~x~0=0.0] [L15] assert false; VAL [~IN~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=0.0, ~x~0=0.0] [L14] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39)) VAL [~IN~0=0.0, ~x~0=0.0] [L15] assert false; VAL [~IN~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=0.0, ~x~0=0.0] [L14] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39)) VAL [~IN~0=0.0, ~x~0=0.0] [L15] assert false; VAL [~IN~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=0.0, ~x~0=0.0] [L14] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39)) VAL [~IN~0=0.0, ~x~0=0.0] [L15] assert false; VAL [~IN~0=0.0, ~x~0=0.0] [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11-L12] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [IN=0, x=0] [L14] COND TRUE !(result >= 0.0f && result < 1.39f) VAL [IN=0, x=0] [L15] __VERIFIER_error() VAL [IN=0, x=0] ----- [2018-11-23 14:02:16,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:02:16 BoogieIcfgContainer [2018-11-23 14:02:16,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:02:16,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:02:16,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:02:16,789 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:02:16,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:16" (3/4) ... [2018-11-23 14:02:16,791 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:02:16,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:02:16,792 INFO L168 Benchmark]: Toolchain (without parser) took 529.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:02:16,793 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:02:16,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.93 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:02:16,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.68 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 943.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:02:16,795 INFO L168 Benchmark]: Boogie Preprocessor took 11.55 ms. Allocated memory is still 1.0 GB. Free memory is still 943.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:02:16,796 INFO L168 Benchmark]: RCFGBuilder took 171.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:02:16,796 INFO L168 Benchmark]: TraceAbstraction took 179.06 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:02:16,797 INFO L168 Benchmark]: Witness Printer took 3.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:02:16,800 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.93 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.68 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 943.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.55 ms. Allocated memory is still 1.0 GB. Free memory is still 943.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 171.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 179.06 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.21 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: 15]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 14, overapproximation of someBinaryArithmeticFLOAToperation at line 12. Possible FailurePath: [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11-L12] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [IN=0, x=0] [L14] COND TRUE !(result >= 0.0f && result < 1.39f) VAL [IN=0, x=0] [L15] __VERIFIER_error() VAL [IN=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 14:02:18,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:02:18,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:02:18,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:02:18,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:02:18,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:02:18,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:02:18,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:02:18,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:02:18,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:02:18,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:02:18,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:02:18,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:02:18,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:02:18,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:02:18,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:02:18,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:02:18,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:02:18,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:02:18,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:02:18,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:02:18,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:02:18,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:02:18,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:02:18,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:02:18,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:02:18,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:02:18,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:02:18,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:02:18,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:02:18,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:02:18,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:02:18,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:02:18,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:02:18,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:02:18,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:02:18,246 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 14:02:18,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:02:18,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:02:18,258 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:02:18,258 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:02:18,258 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:02:18,258 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:02:18,258 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:02:18,258 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:02:18,259 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:02:18,259 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:02:18,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:02:18,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:02:18,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:02:18,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:02:18,261 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:02:18,261 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:02:18,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:02:18,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:02:18,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:02:18,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:02:18,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:02:18,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:02:18,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:02:18,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:02:18,262 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 14:02:18,262 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:02:18,262 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:02:18,262 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:02:18,265 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_9ef96f69-1524-4765-909a-fa8a1e1ce09a/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 -> 9b4984d971b5a5a3b565edf502e7d7464558f166 [2018-11-23 14:02:18,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:02:18,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:02:18,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:02:18,308 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:02:18,309 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:02:18,309 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/../../sv-benchmarks/c/floats-cdfpl/square_1_false-unreach-call_true-termination.i [2018-11-23 14:02:18,353 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/4fbcc5957/1becc1d6a0474611b71e4ae1c5b21f10/FLAG8dc4038cc [2018-11-23 14:02:18,741 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:02:18,742 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/sv-benchmarks/c/floats-cdfpl/square_1_false-unreach-call_true-termination.i [2018-11-23 14:02:18,745 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/4fbcc5957/1becc1d6a0474611b71e4ae1c5b21f10/FLAG8dc4038cc [2018-11-23 14:02:18,756 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/data/4fbcc5957/1becc1d6a0474611b71e4ae1c5b21f10 [2018-11-23 14:02:18,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:02:18,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:02:18,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:02:18,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:02:18,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:02:18,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac99b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18, skipping insertion in model container [2018-11-23 14:02:18,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:02:18,783 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:02:18,896 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:02:18,900 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:02:18,910 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:02:18,918 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:02:18,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18 WrapperNode [2018-11-23 14:02:18,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:02:18,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:02:18,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:02:18,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:02:18,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:02:18,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:02:18,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:02:18,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:02:18,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... [2018-11-23 14:02:18,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:02:18,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:02:18,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:02:18,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:02:18,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:02:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:02:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:02:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:02:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:02:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:02:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:02:21,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:02:21,171 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 14:02:21,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:21 BoogieIcfgContainer [2018-11-23 14:02:21,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:02:21,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:02:21,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:02:21,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:02:21,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:02:18" (1/3) ... [2018-11-23 14:02:21,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7afd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:02:21, skipping insertion in model container [2018-11-23 14:02:21,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:18" (2/3) ... [2018-11-23 14:02:21,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7afd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:02:21, skipping insertion in model container [2018-11-23 14:02:21,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:21" (3/3) ... [2018-11-23 14:02:21,177 INFO L112 eAbstractionObserver]: Analyzing ICFG square_1_false-unreach-call_true-termination.i [2018-11-23 14:02:21,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:02:21,187 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:02:21,196 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:02:21,215 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:02:21,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:02:21,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:02:21,215 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:02:21,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:02:21,216 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:02:21,216 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:02:21,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:02:21,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:02:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-11-23 14:02:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:02:21,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:02:21,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:02:21,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:02:21,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2109216782, now seen corresponding path program 1 times [2018-11-23 14:02:21,243 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:02:21,243 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 14:02:21,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:24,763 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #16#return; [?] CALL call #t~ret2 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32);~x~0 := ~IN~0;~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [main_~IN~0=(fp #b0 #b01111110 #b11110011011010000000000), main_~result~0=(fp #b0 #b01111111 #b01100100001100111110100), main_~x~0=(fp #b0 #b01111110 #b11110011011010000000000)] [?] assume !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))); VAL [main_~IN~0=(fp #b0 #b01111110 #b11110011011010000000000), main_~result~0=(fp #b0 #b01111111 #b01100100001100111110100), main_~x~0=(fp #b0 #b01111110 #b11110011011010000000000)] [?] assume !false; VAL [main_~IN~0=(fp #b0 #b01111110 #b11110011011010000000000), main_~result~0=(fp #b0 #b01111111 #b01100100001100111110100), main_~x~0=(fp #b0 #b01111110 #b11110011011010000000000)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14-L15] assume !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14-L15] assume !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11-L12] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] [L14] COND TRUE !(result >= 0.0f && result < 1.39f) VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] [L15] __VERIFIER_error() VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] ----- [2018-11-23 14:03:24,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:03:24 BoogieIcfgContainer [2018-11-23 14:03:24,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:03:24,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:03:24,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:03:24,788 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:03:24,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:21" (3/4) ... [2018-11-23 14:03:24,791 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #16#return; [?] CALL call #t~ret2 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32);~x~0 := ~IN~0;~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [main_~IN~0=(fp #b0 #b01111110 #b11110011011010000000000), main_~result~0=(fp #b0 #b01111111 #b01100100001100111110100), main_~x~0=(fp #b0 #b01111110 #b11110011011010000000000)] [?] assume !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))); VAL [main_~IN~0=(fp #b0 #b01111110 #b11110011011010000000000), main_~result~0=(fp #b0 #b01111111 #b01100100001100111110100), main_~x~0=(fp #b0 #b01111110 #b11110011011010000000000)] [?] assume !false; VAL [main_~IN~0=(fp #b0 #b01111110 #b11110011011010000000000), main_~result~0=(fp #b0 #b01111111 #b01100100001100111110100), main_~x~0=(fp #b0 #b01111110 #b11110011011010000000000)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14-L15] assume !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14-L15] assume !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.geq~FLOAT(~IN~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11-L12] ~result~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.5), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.125), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0)); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L14] COND TRUE !(~fp.geq~FLOAT(~result~0, ~Pluszero~FLOAT()) && ~fp.lt~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.39))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L15] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 3283444bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 7975936bv23)] [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11-L12] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] [L14] COND TRUE !(result >= 0.0f && result < 1.39f) VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] [L15] __VERIFIER_error() VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] ----- [2018-11-23 14:03:24,818 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9ef96f69-1524-4765-909a-fa8a1e1ce09a/bin-2019/utaipan/witness.graphml [2018-11-23 14:03:24,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:03:24,819 INFO L168 Benchmark]: Toolchain (without parser) took 66060.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:03:24,820 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:03:24,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.81 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:24,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.55 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:24,821 INFO L168 Benchmark]: Boogie Preprocessor took 17.36 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:03:24,821 INFO L168 Benchmark]: RCFGBuilder took 2219.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:24,821 INFO L168 Benchmark]: TraceAbstraction took 63615.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:24,821 INFO L168 Benchmark]: Witness Printer took 30.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:03:24,823 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.81 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.55 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.36 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2219.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63615.34 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. * Witness Printer took 30.09 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: - CounterExampleResult [Line: 15]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11-L12] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] [L14] COND TRUE !(result >= 0.0f && result < 1.39f) VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] [L15] __VERIFIER_error() VAL [IN=0.97540283203125, result=1.3914170265197754, x=0.97540283203125] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 63.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 50.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...