./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cdfpl/sine_2_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_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/sine_2_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79593329bc8f7511983805b3e0e5d4c7fc3a0674 ....................................................................................................................................................................................................................................................................................................................................................................... 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_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/sine_2_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79593329bc8f7511983805b3e0e5d4c7fc3a0674 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:35:47,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:35:47,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:35:47,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:35:47,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:35:47,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:35:47,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:35:47,512 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:35:47,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:35:47,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:35:47,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:35:47,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:35:47,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:35:47,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:35:47,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:35:47,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:35:47,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:35:47,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:35:47,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:35:47,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:35:47,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:35:47,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:35:47,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:35:47,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:35:47,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:35:47,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:35:47,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:35:47,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:35:47,528 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:35:47,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:35:47,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:35:47,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:35:47,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:35:47,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:35:47,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:35:47,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:35:47,532 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:35:47,540 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:35:47,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:35:47,541 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:35:47,541 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:35:47,541 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:35:47,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:35:47,541 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:35:47,541 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:35:47,541 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:35:47,542 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:35:47,542 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:35:47,542 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:35:47,542 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:35:47,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:35:47,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:35:47,543 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:35:47,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:35:47,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:35:47,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:35:47,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:35:47,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:35:47,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:35:47,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:35:47,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:35:47,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:35:47,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:35:47,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:35:47,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:35:47,545 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:35:47,545 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79593329bc8f7511983805b3e0e5d4c7fc3a0674 [2018-11-23 02:35:47,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:35:47,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:35:47,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:35:47,579 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:35:47,579 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:35:47,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/../../sv-benchmarks/c/floats-cdfpl/sine_2_false-unreach-call_true-termination.i [2018-11-23 02:35:47,616 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/88991f538/5783d8f169574d52b18bdb67d9a4d90e/FLAG78ac02631 [2018-11-23 02:35:47,948 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:35:47,948 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/sv-benchmarks/c/floats-cdfpl/sine_2_false-unreach-call_true-termination.i [2018-11-23 02:35:47,952 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/88991f538/5783d8f169574d52b18bdb67d9a4d90e/FLAG78ac02631 [2018-11-23 02:35:48,384 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/88991f538/5783d8f169574d52b18bdb67d9a4d90e [2018-11-23 02:35:48,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:35:48,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:35:48,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:35:48,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:35:48,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:35:48,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48, skipping insertion in model container [2018-11-23 02:35:48,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:35:48,418 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:35:48,527 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:35:48,531 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:35:48,545 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:35:48,554 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:35:48,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48 WrapperNode [2018-11-23 02:35:48,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:35:48,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:35:48,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:35:48,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:35:48,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:35:48,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:35:48,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:35:48,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:35:48,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... [2018-11-23 02:35:48,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:35:48,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:35:48,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:35:48,582 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:35:48,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:35:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:35:48,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:35:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:35:48,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:35:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:35:48,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:35:48,763 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:35:48,764 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 02:35:48,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:48 BoogieIcfgContainer [2018-11-23 02:35:48,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:35:48,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:35:48,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:35:48,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:35:48,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:35:48" (1/3) ... [2018-11-23 02:35:48,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a45769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:35:48, skipping insertion in model container [2018-11-23 02:35:48,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:48" (2/3) ... [2018-11-23 02:35:48,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a45769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:35:48, skipping insertion in model container [2018-11-23 02:35:48,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:48" (3/3) ... [2018-11-23 02:35:48,770 INFO L112 eAbstractionObserver]: Analyzing ICFG sine_2_false-unreach-call_true-termination.i [2018-11-23 02:35:48,780 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:35:48,786 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:35:48,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:35:48,823 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:35:48,823 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:35:48,823 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:35:48,823 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:35:48,824 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:35:48,824 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:35:48,824 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:35:48,824 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:35:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-11-23 02:35:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 02:35:48,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:35:48,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:35:48,845 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:35:48,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:48,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2109216782, now seen corresponding path program 1 times [2018-11-23 02:35:48,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:35:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:48,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:35:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:48,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:35:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:48,926 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #16#return; [?] CALL call #t~ret2 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.57079632679)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.57079632679) then 1 else 0);~x~0 := ~IN~0;~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), 5040.0)); VAL [main_~IN~0=0.0, main_~x~0=0.0] [?] assume !(~someBinaryFLOATComparisonOperation(~result~0, 1.0) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.0))); VAL [main_~IN~0=0.0, main_~x~0=0.0] [?] assume !false; VAL [main_~IN~0=0.0, main_~x~0=0.0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.57079632679)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.57079632679) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), 5040.0)); VAL [~IN~0=0.0, ~x~0=0.0] [L13-L14] assume !(~someBinaryFLOATComparisonOperation(~result~0, 1.0) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.0))); VAL [~IN~0=0.0, ~x~0=0.0] [L14] assert false; VAL [~IN~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.57079632679)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.57079632679) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), 5040.0)); VAL [~IN~0=0.0, ~x~0=0.0] [L13-L14] assume !(~someBinaryFLOATComparisonOperation(~result~0, 1.0) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.0))); VAL [~IN~0=0.0, ~x~0=0.0] [L14] assert false; VAL [~IN~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.57079632679)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.57079632679) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), 5040.0)); VAL [~IN~0=0.0, ~x~0=0.0] [L13] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 1.0) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.0))) VAL [~IN~0=0.0, ~x~0=0.0] [L14] assert false; VAL [~IN~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.57079632679)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.57079632679) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), 5040.0)); VAL [~IN~0=0.0, ~x~0=0.0] [L13] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 1.0) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.0))) VAL [~IN~0=0.0, ~x~0=0.0] [L14] assert false; VAL [~IN~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.57079632679)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.57079632679) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), 5040.0)); VAL [~IN~0=0.0, ~x~0=0.0] [L13] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 1.0) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.0))) VAL [~IN~0=0.0, ~x~0=0.0] [L14] assert false; VAL [~IN~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.57079632679)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.57079632679) then 1 else 0); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), 5040.0)); VAL [~IN~0=0.0, ~x~0=0.0] [L13] COND TRUE !(~someBinaryFLOATComparisonOperation(~result~0, 1.0) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.0))) VAL [~IN~0=0.0, ~x~0=0.0] [L14] assert false; VAL [~IN~0=0.0, ~x~0=0.0] [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11] float result = x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [IN=0, x=0] [L13] COND TRUE !(result <= 1.0f && result >= -1.0f) VAL [IN=0, x=0] [L14] __VERIFIER_error() VAL [IN=0, x=0] ----- [2018-11-23 02:35:48,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:35:48 BoogieIcfgContainer [2018-11-23 02:35:48,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:35:48,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:35:48,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:35:48,946 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:35:48,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:48" (3/4) ... [2018-11-23 02:35:48,948 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:35:48,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:35:48,949 INFO L168 Benchmark]: Toolchain (without parser) took 561.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:35:48,950 INFO L168 Benchmark]: CDTParser took 0.12 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 02:35:48,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.90 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 02:35:48,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.06 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 02:35:48,952 INFO L168 Benchmark]: Boogie Preprocessor took 12.84 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 02:35:48,952 INFO L168 Benchmark]: RCFGBuilder took 182.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:35:48,953 INFO L168 Benchmark]: TraceAbstraction took 180.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:35:48,954 INFO L168 Benchmark]: Witness Printer took 3.06 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 02:35:48,957 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.90 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 14.06 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 12.84 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 182.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 180.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 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: 14]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 13, overapproximation of someBinaryArithmeticFLOAToperation at line 11. Possible FailurePath: [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11] float result = x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [IN=0, x=0] [L13] COND TRUE !(result <= 1.0f && result >= -1.0f) VAL [IN=0, x=0] [L14] __VERIFIER_error() VAL [IN=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:35:50,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:35:50,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:35:50,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:35:50,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:35:50,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:35:50,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:35:50,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:35:50,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:35:50,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:35:50,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:35:50,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:35:50,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:35:50,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:35:50,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:35:50,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:35:50,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:35:50,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:35:50,389 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:35:50,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:35:50,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:35:50,392 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:35:50,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:35:50,394 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:35:50,394 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:35:50,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:35:50,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:35:50,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:35:50,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:35:50,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:35:50,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:35:50,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:35:50,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:35:50,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:35:50,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:35:50,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:35:50,401 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 02:35:50,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:35:50,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:35:50,412 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:35:50,412 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:35:50,413 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:35:50,413 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:35:50,413 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:35:50,413 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:35:50,413 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:35:50,413 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:35:50,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:35:50,414 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:35:50,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:35:50,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:35:50,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:35:50,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:35:50,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:35:50,415 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:35:50,415 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:35:50,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:35:50,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:35:50,415 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:35:50,416 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:35:50,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:35:50,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:35:50,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:35:50,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:35:50,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:35:50,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:35:50,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:35:50,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:35:50,417 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 02:35:50,417 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:35:50,417 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:35:50,417 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:35:50,420 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_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79593329bc8f7511983805b3e0e5d4c7fc3a0674 [2018-11-23 02:35:50,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:35:50,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:35:50,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:35:50,462 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:35:50,463 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:35:50,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/../../sv-benchmarks/c/floats-cdfpl/sine_2_false-unreach-call_true-termination.i [2018-11-23 02:35:50,508 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/96532d2ed/4e80ecee7a0c4fb4824ee7ed96533286/FLAG70bdd4ea3 [2018-11-23 02:35:50,798 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:35:50,799 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/sv-benchmarks/c/floats-cdfpl/sine_2_false-unreach-call_true-termination.i [2018-11-23 02:35:50,802 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/96532d2ed/4e80ecee7a0c4fb4824ee7ed96533286/FLAG70bdd4ea3 [2018-11-23 02:35:50,810 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/data/96532d2ed/4e80ecee7a0c4fb4824ee7ed96533286 [2018-11-23 02:35:50,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:35:50,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:35:50,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:35:50,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:35:50,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:35:50,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e7d3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50, skipping insertion in model container [2018-11-23 02:35:50,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:35:50,835 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:35:50,944 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:35:50,948 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:35:50,960 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:35:50,969 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:35:50,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50 WrapperNode [2018-11-23 02:35:50,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:35:50,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:35:50,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:35:50,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:35:50,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:35:50,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:35:50,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:35:50,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:35:50,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:50,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... [2018-11-23 02:35:51,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:35:51,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:35:51,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:35:51,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:35:51,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:35:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:35:51,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:35:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:35:51,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:35:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:35:51,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:35:53,583 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:35:53,584 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 02:35:53,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:53 BoogieIcfgContainer [2018-11-23 02:35:53,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:35:53,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:35:53,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:35:53,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:35:53,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:35:50" (1/3) ... [2018-11-23 02:35:53,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff66e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:35:53, skipping insertion in model container [2018-11-23 02:35:53,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:50" (2/3) ... [2018-11-23 02:35:53,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff66e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:35:53, skipping insertion in model container [2018-11-23 02:35:53,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:53" (3/3) ... [2018-11-23 02:35:53,589 INFO L112 eAbstractionObserver]: Analyzing ICFG sine_2_false-unreach-call_true-termination.i [2018-11-23 02:35:53,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:35:53,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:35:53,608 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:35:53,629 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:35:53,630 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:35:53,630 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:35:53,630 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:35:53,630 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:35:53,630 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:35:53,631 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:35:53,631 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:35:53,631 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:35:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-11-23 02:35:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 02:35:53,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:35:53,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:35:53,652 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:35:53,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2109216782, now seen corresponding path program 1 times [2018-11-23 02:35:53,659 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:35:53,659 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 02:35:53,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:42:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:42:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:42:20,919 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #16#return; [?] CALL call #t~ret2 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32);~x~0 := ~IN~0;~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [main_~IN~0=(fp #b0 #b01111111 #b10001111010111001111001), main_~result~0=(fp #b0 #b01111111 #b00000010001110110100011), main_~x~0=(fp #b0 #b01111111 #b10001111010111001111001)] [?] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))); VAL [main_~IN~0=(fp #b0 #b01111111 #b10001111010111001111001), main_~result~0=(fp #b0 #b01111111 #b00000010001110110100011), main_~x~0=(fp #b0 #b01111111 #b10001111010111001111001)] [?] assume !false; VAL [main_~IN~0=(fp #b0 #b01111111 #b10001111010111001111001), main_~result~0=(fp #b0 #b01111111 #b00000010001110110100011), main_~x~0=(fp #b0 #b01111111 #b10001111010111001111001)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11] float result = x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] [L13] COND TRUE !(result <= 1.0f && result >= -1.0f) VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] [L14] __VERIFIER_error() VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] ----- [2018-11-23 02:42:20,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:42:20 BoogieIcfgContainer [2018-11-23 02:42:20,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:42:20,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:42:20,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:42:20,946 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:42:20,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:53" (3/4) ... [2018-11-23 02:42:20,948 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #16#return; [?] CALL call #t~ret2 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32);~x~0 := ~IN~0;~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [main_~IN~0=(fp #b0 #b01111111 #b10001111010111001111001), main_~result~0=(fp #b0 #b01111111 #b00000010001110110100011), main_~x~0=(fp #b0 #b01111111 #b10001111010111001111001)] [?] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))); VAL [main_~IN~0=(fp #b0 #b01111111 #b10001111010111001111001), main_~result~0=(fp #b0 #b01111111 #b00000010001110110100011), main_~x~0=(fp #b0 #b01111111 #b10001111010111001111001)] [?] assume !false; VAL [main_~IN~0=(fp #b0 #b01111111 #b10001111010111001111001), main_~result~0=(fp #b0 #b01111111 #b00000010001110110100011), main_~x~0=(fp #b0 #b01111111 #b10001111010111001111001)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L6] ~IN~0 := #t~nondet1; [L6] havoc #t~nondet1; [L7] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.57079632679)) then 1bv32 else 0bv32); [L9] ~x~0 := ~IN~0; [L11] ~result~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x~0, ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~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~0, ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~x~0), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 73123bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4697721bv23)] [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11] float result = x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] [L13] COND TRUE !(result <= 1.0f && result >= -1.0f) VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] [L14] __VERIFIER_error() VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] ----- [2018-11-23 02:42:20,978 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_64bb6210-55e8-496b-80ba-a5a74b7467ac/bin-2019/utaipan/witness.graphml [2018-11-23 02:42:20,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:42:20,979 INFO L168 Benchmark]: Toolchain (without parser) took 390166.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:42:20,980 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:42:20,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.57 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:42:20,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.28 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:42:20,981 INFO L168 Benchmark]: Boogie Preprocessor took 16.78 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:42:20,981 INFO L168 Benchmark]: RCFGBuilder took 2583.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:42:20,982 INFO L168 Benchmark]: TraceAbstraction took 387360.95 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:42:20,982 INFO L168 Benchmark]: Witness Printer took 32.71 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 02:42:20,985 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.57 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.28 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.78 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2583.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 387360.95 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Witness Printer took 32.71 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: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L6] float IN = __VERIFIER_nondet_float(); [L9] float x = IN; [L11] float result = x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] [L13] COND TRUE !(result <= 1.0f && result >= -1.0f) VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] [L14] __VERIFIER_error() VAL [IN=1.5600119829177856, result=1.0087169408798218, x=1.5600119829177856] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 387.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=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 368.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...