./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.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_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:28:11,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:28:11,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:28:11,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:28:11,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:28:11,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:28:11,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:28:11,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:28:11,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:28:11,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:28:11,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:28:11,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:28:11,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:28:11,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:28:11,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:28:11,048 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:28:11,049 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:28:11,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:28:11,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:28:11,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:28:11,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:28:11,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:28:11,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:28:11,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:28:11,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:28:11,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:28:11,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:28:11,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:28:11,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:28:11,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:28:11,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:28:11,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:28:11,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:28:11,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:28:11,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:28:11,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:28:11,061 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 13:28:11,070 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:28:11,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:28:11,071 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:28:11,071 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:28:11,071 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:28:11,071 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:28:11,072 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:28:11,072 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:28:11,072 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:28:11,072 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:28:11,072 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:28:11,072 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:28:11,072 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:28:11,073 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:28:11,073 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:28:11,073 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:28:11,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:28:11,073 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:28:11,074 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:28:11,074 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:28:11,074 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:28:11,074 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:28:11,074 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:28:11,074 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:28:11,074 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:28:11,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:28:11,075 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:28:11,075 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:28:11,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:28:11,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:28:11,075 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:28:11,075 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:28:11,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:28:11,076 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:28:11,076 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:28:11,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:28:11,076 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:28:11,076 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 [2018-11-23 13:28:11,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:28:11,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:28:11,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:28:11,111 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:28:11,112 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:28:11,112 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 13:28:11,156 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/d3ead673e/df24c3a998a64cd48c04b53091ed01d2/FLAG9a55ed78c [2018-11-23 13:28:11,480 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:28:11,480 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 13:28:11,484 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/d3ead673e/df24c3a998a64cd48c04b53091ed01d2/FLAG9a55ed78c [2018-11-23 13:28:11,913 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/d3ead673e/df24c3a998a64cd48c04b53091ed01d2 [2018-11-23 13:28:11,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:28:11,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:28:11,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:28:11,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:28:11,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:28:11,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:11" (1/1) ... [2018-11-23 13:28:11,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a31ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:11, skipping insertion in model container [2018-11-23 13:28:11,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:11" (1/1) ... [2018-11-23 13:28:11,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:28:11,941 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:28:12,057 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:28:12,059 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:28:12,071 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:28:12,079 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:28:12,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12 WrapperNode [2018-11-23 13:28:12,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:28:12,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:28:12,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:28:12,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:28:12,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:28:12,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:28:12,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:28:12,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:28:12,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... [2018-11-23 13:28:12,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:28:12,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:28:12,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:28:12,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:28:12,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:28:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:28:12,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:28:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:28:12,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:28:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:28:12,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:28:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:28:12,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:28:12,265 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:28:12,265 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:28:12,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:12 BoogieIcfgContainer [2018-11-23 13:28:12,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:28:12,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:28:12,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:28:12,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:28:12,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:28:11" (1/3) ... [2018-11-23 13:28:12,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f875c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:28:12, skipping insertion in model container [2018-11-23 13:28:12,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:12" (2/3) ... [2018-11-23 13:28:12,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f875c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:28:12, skipping insertion in model container [2018-11-23 13:28:12,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:12" (3/3) ... [2018-11-23 13:28:12,270 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1_false-unreach-call.c.i [2018-11-23 13:28:12,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:28:12,282 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:28:12,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:28:12,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:28:12,320 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:28:12,320 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:28:12,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:28:12,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:28:12,321 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:28:12,321 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:28:12,321 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:28:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:28:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:28:12,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:28:12,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:12,338 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:28:12,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash -722424895, now seen corresponding path program 1 times [2018-11-23 13:28:12,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:28:12,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:12,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:12,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:12,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:28:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:12,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:28:12,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:28:12,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:28:12,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:28:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:28:12,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:28:12,426 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:28:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:28:12,440 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:28:12,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:28:12,441 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:28:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:28:12,446 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:28:12,446 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:28:12,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:28:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:28:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:28:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:28:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:28:12,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:28:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:28:12,470 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:28:12,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:28:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:28:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:28:12,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:28:12,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:12,471 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:28:12,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:12,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1142459876, now seen corresponding path program 1 times [2018-11-23 13:28:12,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:28:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:12,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:12,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:12,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:28:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:12,506 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret4 := main(); [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~exp~0 := 1.0;~term~0 := 1.0;~count~0 := 1;~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0)));havoc ~temp~0; VAL [main_~count~0=1, main_~exp~0=1.0, main_~term~0=1.0, main_~x~0=2.0] [?] assume !false;~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0)));~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0);#t~post2 := ~count~0;~count~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~temp~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~count~0=2, main_~temp~0=0, main_~x~0=2.0] [?] assume 0 == ~temp~0; VAL [main_~count~0=2, main_~temp~0=0, main_~x~0=2.0] [?] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] assume !false; [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] assume 0 == ~temp~0; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] assume !false; [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] assume 0 == ~temp~0; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1, term=1, x=2] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, temp=0, x=2] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:28:12,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:28:12 BoogieIcfgContainer [2018-11-23 13:28:12,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:28:12,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:28:12,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:28:12,531 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:28:12,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:12" (3/4) ... [2018-11-23 13:28:12,533 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:28:12,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:28:12,534 INFO L168 Benchmark]: Toolchain (without parser) took 618.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:12,535 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:28:12,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.59 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:12,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.31 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:12,536 INFO L168 Benchmark]: Boogie Preprocessor took 12.21 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:28:12,536 INFO L168 Benchmark]: RCFGBuilder took 161.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:12,537 INFO L168 Benchmark]: TraceAbstraction took 264.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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:12,537 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:28:12,539 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.59 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.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 11.31 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.21 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 161.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 264.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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 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: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1, term=1, x=2] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, temp=0, x=2] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 13:28:13,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:28:13,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:28:13,954 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:28:13,954 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:28:13,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:28:13,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:28:13,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:28:13,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:28:13,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:28:13,959 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:28:13,959 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:28:13,960 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:28:13,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:28:13,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:28:13,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:28:13,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:28:13,964 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:28:13,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:28:13,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:28:13,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:28:13,967 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:28:13,969 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:28:13,969 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:28:13,969 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:28:13,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:28:13,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:28:13,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:28:13,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:28:13,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:28:13,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:28:13,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:28:13,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:28:13,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:28:13,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:28:13,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:28:13,975 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 13:28:13,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:28:13,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:28:13,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:28:13,985 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:28:13,986 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:28:13,986 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:28:13,986 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:28:13,986 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:28:13,986 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:28:13,986 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:28:13,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:28:13,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:28:13,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:28:13,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:28:13,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:28:13,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:28:13,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:28:13,988 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:28:13,988 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:28:13,988 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:28:13,988 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:28:13,989 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:28:13,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:28:13,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:28:13,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:28:13,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:28:13,989 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:28:13,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:28:13,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:28:13,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:28:13,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:28:13,990 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 13:28:13,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:28:13,990 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:28:13,991 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:28:13,991 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_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 [2018-11-23 13:28:14,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:28:14,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:28:14,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:28:14,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:28:14,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:28:14,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 13:28:14,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/7281e5e95/24439ca25a9748e9a26ea24bf60d3489/FLAG74d95aa29 [2018-11-23 13:28:14,397 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:28:14,397 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 13:28:14,401 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/7281e5e95/24439ca25a9748e9a26ea24bf60d3489/FLAG74d95aa29 [2018-11-23 13:28:14,835 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/data/7281e5e95/24439ca25a9748e9a26ea24bf60d3489 [2018-11-23 13:28:14,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:28:14,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:28:14,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:28:14,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:28:14,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:28:14,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:14" (1/1) ... [2018-11-23 13:28:14,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706138e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:14, skipping insertion in model container [2018-11-23 13:28:14,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:14" (1/1) ... [2018-11-23 13:28:14,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:28:14,861 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:28:14,992 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:28:14,996 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:28:15,008 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:28:15,017 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:28:15,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15 WrapperNode [2018-11-23 13:28:15,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:28:15,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:28:15,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:28:15,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:28:15,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:28:15,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:28:15,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:28:15,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:28:15,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... [2018-11-23 13:28:15,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:28:15,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:28:15,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:28:15,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:28:15,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:28:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:28:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:28:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:28:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:28:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:28:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:28:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:28:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:28:16,899 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:28:16,899 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:28:16,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:16 BoogieIcfgContainer [2018-11-23 13:28:16,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:28:16,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:28:16,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:28:16,902 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:28:16,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:28:14" (1/3) ... [2018-11-23 13:28:16,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dbb978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:28:16, skipping insertion in model container [2018-11-23 13:28:16,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:15" (2/3) ... [2018-11-23 13:28:16,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dbb978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:28:16, skipping insertion in model container [2018-11-23 13:28:16,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:16" (3/3) ... [2018-11-23 13:28:16,904 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1_false-unreach-call.c.i [2018-11-23 13:28:16,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:28:16,917 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:28:16,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:28:16,942 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:28:16,943 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:28:16,943 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:28:16,943 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:28:16,943 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:28:16,943 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:28:16,943 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:28:16,944 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:28:16,944 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:28:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:28:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:28:16,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:28:16,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:16,961 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:28:16,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash -722424895, now seen corresponding path program 1 times [2018-11-23 13:28:16,966 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:28:16,967 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 13:28:16,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:17,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:17,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:28:17,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:28:17,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:28:17,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:28:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:28:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:28:17,235 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:28:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:28:17,250 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:28:17,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:28:17,251 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:28:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:28:17,257 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:28:17,257 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:28:17,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:28:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:28:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:28:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:28:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:28:17,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:28:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:28:17,288 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:28:17,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:28:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:28:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:28:17,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:28:17,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:17,289 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:28:17,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1142459876, now seen corresponding path program 1 times [2018-11-23 13:28:17,290 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:28:17,290 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 13:28:17,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:18,340 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret4 := main(); [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~count~0 := 1bv32;~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0)));havoc ~temp~0; VAL [main_~count~0=(_ bv1 32), main_~exp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~term~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume !false;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0)));~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0);#t~post2 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~temp~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume 0bv32 == ~temp~0; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1.0, result=-273.0666809082031, term=1.0, x=1.00732421875] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, exp=2.00732421875, result=-273.0666809082031, temp=0, term=1.00732421875, x=1.00732421875] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:28:18,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:28:18 BoogieIcfgContainer [2018-11-23 13:28:18,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:28:18,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:28:18,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:28:18,369 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:28:18,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:16" (3/4) ... [2018-11-23 13:28:18,371 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 #37#return; [?] CALL call #t~ret4 := main(); [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~count~0 := 1bv32;~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0)));havoc ~temp~0; VAL [main_~count~0=(_ bv1 32), main_~exp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~term~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume !false;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0)));~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0);#t~post2 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~temp~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume 0bv32 == ~temp~0; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1.0, result=-273.0666809082031, term=1.0, x=1.00732421875] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, exp=2.00732421875, result=-273.0666809082031, temp=0, term=1.00732421875, x=1.00732421875] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:28:18,400 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1d368f06-e996-45a7-a297-575eea9bd44b/bin-2019/utaipan/witness.graphml [2018-11-23 13:28:18,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:28:18,401 INFO L168 Benchmark]: Toolchain (without parser) took 3563.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -113.1 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:18,402 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:28:18,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.22 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 933.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:18,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.10 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:18,403 INFO L168 Benchmark]: Boogie Preprocessor took 17.50 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:28:18,403 INFO L168 Benchmark]: RCFGBuilder took 1849.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:18,403 INFO L168 Benchmark]: TraceAbstraction took 1468.94 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:18,404 INFO L168 Benchmark]: Witness Printer took 31.75 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-23 13:28:18,405 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.22 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 933.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.10 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.50 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1849.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1468.94 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Witness Printer took 31.75 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: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1.0, result=-273.0666809082031, term=1.0, x=1.00732421875] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, exp=2.00732421875, result=-273.0666809082031, temp=0, term=1.00732421875, x=1.00732421875] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 22 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...