./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cdfpl/sine_3_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_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/sine_3_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efc3beffa131f51d6103293c64eabba4e9dcb6a3 .................................................................................................................................................................................................................................................................................................................................................................. 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_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/sine_3_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efc3beffa131f51d6103293c64eabba4e9dcb6a3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-22 23:18:56,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:18:56,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:18:56,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:18:56,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:18:56,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:18:56,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:18:56,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:18:56,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:18:56,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:18:56,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:18:56,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:18:56,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:18:56,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:18:56,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:18:56,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:18:56,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:18:56,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:18:56,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:18:56,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:18:56,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:18:56,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:18:56,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:18:56,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:18:56,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:18:56,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:18:56,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:18:56,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:18:56,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:18:56,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:18:56,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:18:56,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:18:56,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:18:56,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:18:56,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:18:56,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:18:56,926 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 23:18:56,936 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:18:56,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:18:56,937 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:18:56,937 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:18:56,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:18:56,938 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:18:56,938 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:18:56,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:18:56,938 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:18:56,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:18:56,938 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:18:56,938 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:18:56,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:18:56,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:18:56,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:18:56,939 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:18:56,939 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:18:56,939 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:18:56,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:18:56,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:18:56,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:18:56,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:18:56,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:18:56,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:18:56,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:18:56,940 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:18:56,940 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:18:56,941 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:18:56,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:18:56,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:18:56,941 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_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efc3beffa131f51d6103293c64eabba4e9dcb6a3 [2018-11-22 23:18:56,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:18:56,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:18:56,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:18:56,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:18:56,975 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:18:56,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/sine_3_false-unreach-call_true-termination.i [2018-11-22 23:18:57,011 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/a97dc2782/2578c641c3a443399eefbbc36d5f978f/FLAG05aeee25d [2018-11-22 23:18:57,411 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:18:57,412 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/sv-benchmarks/c/floats-cdfpl/sine_3_false-unreach-call_true-termination.i [2018-11-22 23:18:57,417 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/a97dc2782/2578c641c3a443399eefbbc36d5f978f/FLAG05aeee25d [2018-11-22 23:18:57,427 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/a97dc2782/2578c641c3a443399eefbbc36d5f978f [2018-11-22 23:18:57,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:18:57,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:18:57,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:18:57,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:18:57,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:18:57,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5123cbca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57, skipping insertion in model container [2018-11-22 23:18:57,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:18:57,460 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:18:57,590 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:18:57,594 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:18:57,606 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:18:57,616 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:18:57,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57 WrapperNode [2018-11-22 23:18:57,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:18:57,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:18:57,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:18:57,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:18:57,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:18:57,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:18:57,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:18:57,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:18:57,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... [2018-11-22 23:18:57,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:18:57,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:18:57,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:18:57,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:18:57,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:18:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:18:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:18:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:18:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:18:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:18:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:18:57,783 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:18:57,783 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 23:18:57,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:18:57 BoogieIcfgContainer [2018-11-22 23:18:57,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:18:57,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:18:57,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:18:57,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:18:57,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:18:57" (1/3) ... [2018-11-22 23:18:57,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa6780a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:18:57, skipping insertion in model container [2018-11-22 23:18:57,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:18:57" (2/3) ... [2018-11-22 23:18:57,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa6780a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:18:57, skipping insertion in model container [2018-11-22 23:18:57,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:18:57" (3/3) ... [2018-11-22 23:18:57,789 INFO L112 eAbstractionObserver]: Analyzing ICFG sine_3_false-unreach-call_true-termination.i [2018-11-22 23:18:57,795 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:18:57,799 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:18:57,808 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:18:57,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:18:57,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:18:57,825 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:18:57,825 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:18:57,825 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:18:57,825 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:18:57,826 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:18:57,826 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:18:57,826 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:18:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-11-22 23:18:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-22 23:18:57,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:18:57,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:18:57,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:18:57,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:18:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2109216782, now seen corresponding path program 1 times [2018-11-22 23:18:57,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:18:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:18:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:18:57,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:18:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:18:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:18:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:18:57,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 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.001) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.001))); 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.001) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.001))); 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.001) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.001))); 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.001) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.001))) 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.001) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.001))) 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.001) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.001))) 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.001) && ~someBinaryFLOATComparisonOperation(~result~0, ~someUnaryFLOAToperation(1.001))) 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.001f && result >= -1.001f) VAL [IN=0, x=0] [L14] __VERIFIER_error() VAL [IN=0, x=0] ----- [2018-11-22 23:18:57,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:18:57 BoogieIcfgContainer [2018-11-22 23:18:57,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:18:57,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:18:57,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:18:57,940 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:18:57,940 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:18:57" (3/4) ... [2018-11-22 23:18:57,943 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 23:18:57,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:18:57,944 INFO L168 Benchmark]: Toolchain (without parser) took 514.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:18:57,946 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:18:57,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.00 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-22 23:18:57,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.97 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-22 23:18:57,947 INFO L168 Benchmark]: Boogie Preprocessor took 45.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:18:57,948 INFO L168 Benchmark]: RCFGBuilder took 107.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:18:57,948 INFO L168 Benchmark]: TraceAbstraction took 155.37 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.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:18:57,949 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:18:57,952 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.11 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 186.00 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 12.97 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 45.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 107.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 155.37 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.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 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.001f && result >= -1.001f) 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-22 23:18:59,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:18:59,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:18:59,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:18:59,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:18:59,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:18:59,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:18:59,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:18:59,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:18:59,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:18:59,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:18:59,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:18:59,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:18:59,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:18:59,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:18:59,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:18:59,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:18:59,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:18:59,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:18:59,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:18:59,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:18:59,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:18:59,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:18:59,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:18:59,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:18:59,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:18:59,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:18:59,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:18:59,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:18:59,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:18:59,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:18:59,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:18:59,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:18:59,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:18:59,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:18:59,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:18:59,385 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-22 23:18:59,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:18:59,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:18:59,396 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:18:59,397 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:18:59,397 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:18:59,397 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:18:59,397 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:18:59,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:18:59,398 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:18:59,398 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:18:59,398 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:18:59,398 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:18:59,398 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:18:59,398 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:18:59,398 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 23:18:59,399 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 23:18:59,399 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:18:59,399 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:18:59,399 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:18:59,399 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:18:59,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:18:59,399 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:18:59,399 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:18:59,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:18:59,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:18:59,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:18:59,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:18:59,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:18:59,400 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-22 23:18:59,400 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:18:59,400 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 23:18:59,401 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 23:18:59,401 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_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efc3beffa131f51d6103293c64eabba4e9dcb6a3 [2018-11-22 23:18:59,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:18:59,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:18:59,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:18:59,445 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:18:59,445 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:18:59,446 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/sine_3_false-unreach-call_true-termination.i [2018-11-22 23:18:59,490 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/c7da8921f/20d3c3956747484881971b64206787b2/FLAGa5bcb4881 [2018-11-22 23:18:59,810 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:18:59,811 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/sv-benchmarks/c/floats-cdfpl/sine_3_false-unreach-call_true-termination.i [2018-11-22 23:18:59,814 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/c7da8921f/20d3c3956747484881971b64206787b2/FLAGa5bcb4881 [2018-11-22 23:19:00,247 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/data/c7da8921f/20d3c3956747484881971b64206787b2 [2018-11-22 23:19:00,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:19:00,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:19:00,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:19:00,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:19:00,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:19:00,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@856b342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00, skipping insertion in model container [2018-11-22 23:19:00,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:19:00,278 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:19:00,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:19:00,422 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:19:00,437 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:19:00,449 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:19:00,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00 WrapperNode [2018-11-22 23:19:00,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:19:00,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:19:00,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:19:00,450 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:19:00,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:19:00,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:19:00,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:19:00,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:19:00,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... [2018-11-22 23:19:00,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:19:00,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:19:00,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:19:00,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:19:00,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:19:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:19:00,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:19:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:19:00,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:19:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:19:00,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:19:03,093 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:19:03,093 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 23:19:03,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:03 BoogieIcfgContainer [2018-11-22 23:19:03,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:19:03,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:19:03,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:19:03,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:19:03,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:19:00" (1/3) ... [2018-11-22 23:19:03,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3add9b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:19:03, skipping insertion in model container [2018-11-22 23:19:03,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:00" (2/3) ... [2018-11-22 23:19:03,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3add9b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:19:03, skipping insertion in model container [2018-11-22 23:19:03,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:03" (3/3) ... [2018-11-22 23:19:03,099 INFO L112 eAbstractionObserver]: Analyzing ICFG sine_3_false-unreach-call_true-termination.i [2018-11-22 23:19:03,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:19:03,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:19:03,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:19:03,136 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:19:03,136 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:19:03,136 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:19:03,137 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:19:03,137 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:19:03,137 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:19:03,137 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:19:03,137 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:19:03,137 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:19:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-11-22 23:19:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-22 23:19:03,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:03,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:03,156 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:03,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2109216782, now seen corresponding path program 1 times [2018-11-22 23:19:03,162 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 23:19:03,163 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-22 23:19:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:25:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:25:06,162 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 #b01111010100101101000110), main_~result~0=(fp #b0 #b01111111 #b00000000011101111000111), main_~x~0=(fp #b0 #b01111111 #b01111010100101101000110)] [?] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))); VAL [main_~IN~0=(fp #b0 #b01111111 #b01111010100101101000110), main_~result~0=(fp #b0 #b01111111 #b00000000011101111000111), main_~x~0=(fp #b0 #b01111111 #b01111010100101101000110)] [?] assume !false; VAL [main_~IN~0=(fp #b0 #b01111111 #b01111010100101101000110), main_~result~0=(fp #b0 #b01111111 #b00000000011101111000111), main_~x~0=(fp #b0 #b01111111 #b01111010100101101000110)] [?] 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] ----- ----- 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [?] 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] ----- ----- 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [?] 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] ----- ----- 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [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.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] [L13] COND TRUE !(result <= 1.001f && result >= -1.001f) VAL [IN=1.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] [L14] __VERIFIER_error() VAL [IN=1.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] ----- [2018-11-22 23:25:06,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:25:06 BoogieIcfgContainer [2018-11-22 23:25:06,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:25:06,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:25:06,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:25:06,182 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:25:06,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:03" (3/4) ... [2018-11-22 23:25:06,184 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 #b01111010100101101000110), main_~result~0=(fp #b0 #b01111111 #b00000000011101111000111), main_~x~0=(fp #b0 #b01111111 #b01111010100101101000110)] [?] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))); VAL [main_~IN~0=(fp #b0 #b01111111 #b01111010100101101000110), main_~result~0=(fp #b0 #b01111111 #b00000000011101111000111), main_~x~0=(fp #b0 #b01111111 #b01111010100101101000110)] [?] assume !false; VAL [main_~IN~0=(fp #b0 #b01111111 #b01111010100101101000110), main_~result~0=(fp #b0 #b01111111 #b00000000011101111000111), main_~x~0=(fp #b0 #b01111111 #b01111010100101101000110)] [?] 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] ----- ----- 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13-L14] assume !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))); VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [?] 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] ----- ----- 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [?] 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] ----- ----- 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, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L13] COND TRUE !(~fp.leq~FLOAT(~result~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)) && ~fp.geq~FLOAT(~result~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 1.001)))) VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [L14] assert false; VAL [~IN~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23), ~result~0=~fp~LONGDOUBLE(0bv1, 127bv8, 15303bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 4016966bv23)] [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.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] [L13] COND TRUE !(result <= 1.001f && result >= -1.001f) VAL [IN=1.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] [L14] __VERIFIER_error() VAL [IN=1.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] ----- [2018-11-22 23:25:06,215 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_42495e3f-3470-4a2a-ae4a-ac8c5bdf7c9b/bin-2019/uautomizer/witness.graphml [2018-11-22 23:25:06,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:25:06,216 INFO L168 Benchmark]: Toolchain (without parser) took 365966.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -116.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:25:06,217 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-22 23:25:06,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.83 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:25:06,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.97 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:25:06,218 INFO L168 Benchmark]: Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:25:06,218 INFO L168 Benchmark]: RCFGBuilder took 2606.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:25:06,219 INFO L168 Benchmark]: TraceAbstraction took 363087.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:25:06,219 INFO L168 Benchmark]: Witness Printer took 33.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:25:06,222 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 198.83 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.97 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2606.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 363087.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Witness Printer took 33.38 ms. Allocated memory is still 1.1 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.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] [L13] COND TRUE !(result <= 1.001f && result >= -1.001f) VAL [IN=1.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] [L14] __VERIFIER_error() VAL [IN=1.4788596630096436, result=1.0018242597579956, x=1.4788596630096436] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 363.0s 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, 306.6s 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...