./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cdfpl/newton_1_7_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_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_7_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70fe3c899c400d059184c32a286d7d2375d5f495 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_7_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70fe3c899c400d059184c32a286d7d2375d5f495 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:56:50,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:56:50,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:56:50,413 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:56:50,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:56:50,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:56:50,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:56:50,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:56:50,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:56:50,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:56:50,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:56:50,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:56:50,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:56:50,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:56:50,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:56:50,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:56:50,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:56:50,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:56:50,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:56:50,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:56:50,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:56:50,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:56:50,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:56:50,434 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:56:50,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:56:50,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:56:50,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:56:50,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:56:50,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:56:50,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:56:50,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:56:50,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:56:50,438 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:56:50,438 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:56:50,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:56:50,440 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:56:50,440 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:56:50,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:56:50,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:56:50,450 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:56:50,450 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:56:50,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:56:50,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:56:50,451 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:56:50,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:56:50,451 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:56:50,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:56:50,453 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:56:50,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:56:50,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:56:50,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:56:50,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:56:50,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:56:50,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:56:50,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:56:50,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:56:50,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:56:50,454 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:56:50,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:56:50,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:56:50,454 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_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer 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 -> Automizer 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 -> 70fe3c899c400d059184c32a286d7d2375d5f495 [2018-11-23 03:56:50,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:56:50,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:56:50,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:56:50,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:56:50,491 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:56:50,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/newton_1_7_false-unreach-call_true-termination.i [2018-11-23 03:56:50,528 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/3eb54a899/db337d40305049d780b1b58adcd2b581/FLAG2896444e2 [2018-11-23 03:56:50,917 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:56:50,917 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/sv-benchmarks/c/floats-cdfpl/newton_1_7_false-unreach-call_true-termination.i [2018-11-23 03:56:50,921 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/3eb54a899/db337d40305049d780b1b58adcd2b581/FLAG2896444e2 [2018-11-23 03:56:50,929 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/3eb54a899/db337d40305049d780b1b58adcd2b581 [2018-11-23 03:56:50,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:56:50,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:56:50,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:56:50,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:56:50,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:56:50,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:50" (1/1) ... [2018-11-23 03:56:50,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4044db79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:50, skipping insertion in model container [2018-11-23 03:56:50,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:50" (1/1) ... [2018-11-23 03:56:50,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:56:50,953 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:56:51,063 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:56:51,066 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:56:51,076 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:56:51,084 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:56:51,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51 WrapperNode [2018-11-23 03:56:51,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:56:51,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:56:51,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:56:51,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:56:51,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:56:51,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:56:51,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:56:51,103 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:56:51,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2018-11-23 03:56:51,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:56:51,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:56:51,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:56:51,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:56:51,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/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 03:56:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:56:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:56:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 03:56:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 03:56:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:56:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:56:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-23 03:56:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-23 03:56:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:56:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:56:51,293 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:56:51,293 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 03:56:51,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:51 BoogieIcfgContainer [2018-11-23 03:56:51,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:56:51,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:56:51,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:56:51,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:56:51,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:56:50" (1/3) ... [2018-11-23 03:56:51,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522151bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:51, skipping insertion in model container [2018-11-23 03:56:51,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (2/3) ... [2018-11-23 03:56:51,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522151bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:51, skipping insertion in model container [2018-11-23 03:56:51,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:51" (3/3) ... [2018-11-23 03:56:51,299 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_7_false-unreach-call_true-termination.i [2018-11-23 03:56:51,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:56:51,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:56:51,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:56:51,350 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:56:51,351 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:56:51,351 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:56:51,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:56:51,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:56:51,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:56:51,352 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:56:51,352 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:56:51,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:56:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 03:56:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 03:56:51,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:56:51,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:56:51,374 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:56:51,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:56:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-23 03:56:51,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:56:51,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:56:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:56:51,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:56:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:56:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:56:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:56:51,476 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #23#return; [?] CALL call #t~ret4 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0); VAL [main_~IN~0=2.0] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=2.0] [?] ~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [f_~x=2.0, |f_#in~x|=2.0] [?] assume true; VAL [f_~x=2.0, |f_#in~x|=2.0] [?] RET #27#return; VAL [main_~IN~0=2.0, |main_#t~ret2|=1.0] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=2.0] [?] ~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [fp_~x=2.0, |fp_#in~x|=2.0] [?] assume true; VAL [fp_~x=2.0, |fp_#in~x|=2.0] [?] RET #29#return; VAL [main_~IN~0=2.0, |main_#t~ret2|=1.0, |main_#t~ret3|=0.0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret3;havoc #t~ret2; VAL [main_~IN~0=2.0] [?] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [main_~IN~0=2.0] [?] assume !false; VAL [main_~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L4-L7] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L9-L12] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=2.0] [L27-L28] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L4-L7] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L9-L12] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=2.0] [L27-L28] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=2] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR f(IN) VAL [f(IN)=1, IN=2] [L19] CALL, EXPR fp(IN) VAL [\old(x)=2] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR fp(IN) VAL [f(IN)=1, fp(IN)=0, IN=2] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=2] [L28] __VERIFIER_error() VAL [IN=2] ----- [2018-11-23 03:56:51,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:56:51 BoogieIcfgContainer [2018-11-23 03:56:51,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:56:51,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:56:51,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:56:51,505 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:56:51,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:51" (3/4) ... [2018-11-23 03:56:51,508 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:56:51,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:56:51,509 INFO L168 Benchmark]: Toolchain (without parser) took 577.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:56:51,510 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:56:51,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.59 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.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 03:56:51,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.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 03:56:51,512 INFO L168 Benchmark]: Boogie Preprocessor took 15.49 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:56:51,513 INFO L168 Benchmark]: RCFGBuilder took 175.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:56:51,513 INFO L168 Benchmark]: TraceAbstraction took 210.01 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:56:51,514 INFO L168 Benchmark]: Witness Printer took 4.11 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 03:56:51,516 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.59 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.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 17.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.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 15.49 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 175.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 210.01 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.11 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: 28]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 17, overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticFLOAToperation at line 19. Possible FailurePath: [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=2] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR f(IN) VAL [f(IN)=1, IN=2] [L19] CALL, EXPR fp(IN) VAL [\old(x)=2] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR fp(IN) VAL [f(IN)=1, fp(IN)=0, IN=2] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=2] [L28] __VERIFIER_error() VAL [IN=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 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=22occurred 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, 16 NumberOfCodeBlocks, 16 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 03:56:53,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:56:53,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:56:53,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:56:53,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:56:53,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:56:53,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:56:53,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:56:53,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:56:53,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:56:53,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:56:53,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:56:53,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:56:53,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:56:53,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:56:53,034 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:56:53,035 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:56:53,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:56:53,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:56:53,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:56:53,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:56:53,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:56:53,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:56:53,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:56:53,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:56:53,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:56:53,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:56:53,043 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:56:53,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:56:53,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:56:53,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:56:53,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:56:53,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:56:53,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:56:53,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:56:53,047 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:56:53,047 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 03:56:53,056 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:56:53,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:56:53,057 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:56:53,057 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:56:53,058 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:56:53,058 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:56:53,058 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:56:53,058 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:56:53,058 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:56:53,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:56:53,060 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:56:53,060 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:56:53,060 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:56:53,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:56:53,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:56:53,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:56:53,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:56:53,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:56:53,061 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:56:53,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:56:53,061 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:56:53,061 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 03:56:53,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:56:53,061 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:56:53,061 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:56:53,062 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_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer 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 -> Automizer 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 -> 70fe3c899c400d059184c32a286d7d2375d5f495 [2018-11-23 03:56:53,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:56:53,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:56:53,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:56:53,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:56:53,104 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:56:53,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/newton_1_7_false-unreach-call_true-termination.i [2018-11-23 03:56:53,144 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/e7d62d533/4a52f0f603014a4caa6781a0dc29a2bf/FLAG836678e32 [2018-11-23 03:56:53,532 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:56:53,533 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/sv-benchmarks/c/floats-cdfpl/newton_1_7_false-unreach-call_true-termination.i [2018-11-23 03:56:53,536 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/e7d62d533/4a52f0f603014a4caa6781a0dc29a2bf/FLAG836678e32 [2018-11-23 03:56:53,547 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/data/e7d62d533/4a52f0f603014a4caa6781a0dc29a2bf [2018-11-23 03:56:53,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:56:53,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:56:53,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:56:53,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:56:53,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:56:53,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7500729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53, skipping insertion in model container [2018-11-23 03:56:53,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:56:53,577 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:56:53,701 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:56:53,704 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:56:53,718 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:56:53,729 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:56:53,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53 WrapperNode [2018-11-23 03:56:53,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:56:53,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:56:53,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:56:53,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:56:53,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:56:53,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:56:53,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:56:53,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:56:53,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... [2018-11-23 03:56:53,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:56:53,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:56:53,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:56:53,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:56:53,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/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 03:56:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:56:53,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:56:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 03:56:53,849 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 03:56:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:56:53,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:56:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-23 03:56:53,850 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-23 03:56:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:56:53,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:56:59,140 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:56:59,140 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 03:56:59,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:59 BoogieIcfgContainer [2018-11-23 03:56:59,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:56:59,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:56:59,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:56:59,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:56:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:56:53" (1/3) ... [2018-11-23 03:56:59,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa1461b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:59, skipping insertion in model container [2018-11-23 03:56:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:53" (2/3) ... [2018-11-23 03:56:59,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa1461b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:59, skipping insertion in model container [2018-11-23 03:56:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:59" (3/3) ... [2018-11-23 03:56:59,147 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_7_false-unreach-call_true-termination.i [2018-11-23 03:56:59,154 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:56:59,161 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:56:59,170 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:56:59,187 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:56:59,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:56:59,188 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:56:59,188 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:56:59,188 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:56:59,188 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:56:59,188 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:56:59,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:56:59,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:56:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 03:56:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 03:56:59,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:56:59,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:56:59,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:56:59,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:56:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-23 03:56:59,215 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:56:59,216 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/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 03:56:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:57:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:00:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:00:46,463 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #23#return; [?] CALL call #t~ret4 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [f_~x=(fp #b1 #b01111110 #b01101111011111011111001), |f_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |f_#res|=(fp #b1 #b01111110 #b01010000110000101100100)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b01101111011111011111001), |f_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |f_#res|=(fp #b1 #b01111110 #b01010000110000101100100)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), |main_#t~ret2|=(fp #b1 #b01111110 #b01010000110000101100100)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [fp_~x=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#res|=(fp #b0 #b01111110 #b10000001110111111100100)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#res|=(fp #b0 #b01111110 #b10000001110111111100100)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), |main_#t~ret2|=(fp #b1 #b01111110 #b01010000110000101100100), |main_#t~ret3|=(fp #b0 #b01111110 #b10000001110111111100100)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret3;havoc #t~ret2; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), main_~x~0=(fp #b0 #b01111100 #b00111101010111011110100)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), main_~x~0=(fp #b0 #b01111100 #b00111101010111011110100)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), main_~x~0=(fp #b0 #b01111100 #b00111101010111011110100)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.7177577614784241] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.7177577614784241, \result=-0.65773606300354, x=-0.7177577614784241] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.65773606300354, IN=-0.7177577614784241] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.7177577614784241] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.7177577614784241, \result=0.7536604404449463, x=-0.7177577614784241] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.65773606300354, fp(IN)=0.7536604404449463, IN=-0.7177577614784241] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.7177577614784241, x=0.15496426820755005] [L28] __VERIFIER_error() VAL [IN=-0.7177577614784241, x=0.15496426820755005] ----- [2018-11-23 04:00:46,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:00:46 BoogieIcfgContainer [2018-11-23 04:00:46,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:00:46,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:00:46,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:00:46,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:00:46,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:59" (3/4) ... [2018-11-23 04:00:46,498 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 #23#return; [?] CALL call #t~ret4 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [f_~x=(fp #b1 #b01111110 #b01101111011111011111001), |f_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |f_#res|=(fp #b1 #b01111110 #b01010000110000101100100)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b01101111011111011111001), |f_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |f_#res|=(fp #b1 #b01111110 #b01010000110000101100100)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), |main_#t~ret2|=(fp #b1 #b01111110 #b01010000110000101100100)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [fp_~x=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#res|=(fp #b0 #b01111110 #b10000001110111111100100)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#in~x|=(fp #b1 #b01111110 #b01101111011111011111001), |fp_#res|=(fp #b0 #b01111110 #b10000001110111111100100)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), |main_#t~ret2|=(fp #b1 #b01111110 #b01010000110000101100100), |main_#t~ret3|=(fp #b0 #b01111110 #b10000001110111111100100)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret3;havoc #t~ret2; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), main_~x~0=(fp #b0 #b01111100 #b00111101010111011110100)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), main_~x~0=(fp #b0 #b01111100 #b00111101010111011110100)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b01101111011111011111001), main_~x~0=(fp #b0 #b01111100 #b00111101010111011110100)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.4))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.4)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2646372bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4255716bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3653369bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 2010868bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.7177577614784241] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.7177577614784241, \result=-0.65773606300354, x=-0.7177577614784241] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.65773606300354, IN=-0.7177577614784241] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.7177577614784241] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.7177577614784241, \result=0.7536604404449463, x=-0.7177577614784241] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.65773606300354, fp(IN)=0.7536604404449463, IN=-0.7177577614784241] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.7177577614784241, x=0.15496426820755005] [L28] __VERIFIER_error() VAL [IN=-0.7177577614784241, x=0.15496426820755005] ----- [2018-11-23 04:00:46,537 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c27d5fd2-56ec-4adf-9376-721d65a51c91/bin-2019/uautomizer/witness.graphml [2018-11-23 04:00:46,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:00:46,538 INFO L168 Benchmark]: Toolchain (without parser) took 232988.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:46,540 INFO L168 Benchmark]: CDTParser took 0.16 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 04:00:46,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.63 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:46,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.74 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:00:46,541 INFO L168 Benchmark]: Boogie Preprocessor took 19.08 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:00:46,541 INFO L168 Benchmark]: RCFGBuilder took 5376.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:46,541 INFO L168 Benchmark]: TraceAbstraction took 227354.01 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:46,542 INFO L168 Benchmark]: Witness Printer took 42.03 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 04:00:46,543 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.63 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.74 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.08 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 5376.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 227354.01 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Witness Printer took 42.03 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: 28]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.7177577614784241] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.7177577614784241, \result=-0.65773606300354, x=-0.7177577614784241] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.65773606300354, IN=-0.7177577614784241] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.7177577614784241] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.7177577614784241, \result=0.7536604404449463, x=-0.7177577614784241] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.65773606300354, fp(IN)=0.7536604404449463, IN=-0.7177577614784241] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.7177577614784241, x=0.15496426820755005] [L28] __VERIFIER_error() VAL [IN=-0.7177577614784241, x=0.15496426820755005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. UNSAFE Result, 227.3s 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=22occurred 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, 12.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 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...