./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/cast_union_tight_false-unreach-call_true-termination.c --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_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_union_tight_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/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 6c0005e6146056cc1de3f3f086fde77a54c02f63 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_union_tight_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/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 6c0005e6146056cc1de3f3f086fde77a54c02f63 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:51:07,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:07,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:07,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:07,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:07,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:07,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:07,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:07,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:07,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:07,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:07,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:07,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:07,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:07,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:07,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:07,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:07,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:07,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:07,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:07,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:07,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:07,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:07,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:07,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:07,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:07,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:07,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:07,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:07,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:07,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:07,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:07,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:07,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:07,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:07,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:07,100 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 11:51:07,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:07,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:07,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:07,110 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:07,110 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 11:51:07,110 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 11:51:07,110 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 11:51:07,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 11:51:07,111 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 11:51:07,111 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 11:51:07,111 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 11:51:07,111 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 11:51:07,111 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 11:51:07,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:07,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:07,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:07,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:07,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:07,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:07,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:07,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:07,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:07,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:07,113 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:07,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:07,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:07,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:07,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:07,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:07,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:07,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:07,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:07,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:07,115 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 11:51:07,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:07,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:07,115 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:07,115 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_89b06319-ab56-4cc3-95d5-68ae4e759055/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 -> 6c0005e6146056cc1de3f3f086fde77a54c02f63 [2018-11-23 11:51:07,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:07,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:07,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:07,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:07,155 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:07,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/cast_union_tight_false-unreach-call_true-termination.c [2018-11-23 11:51:07,196 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/8468a6d6d/fd16a8960e09465fb05c43cc7d9bf4bd/FLAGc5abcafe8 [2018-11-23 11:51:07,582 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:07,583 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/sv-benchmarks/c/float-benchs/cast_union_tight_false-unreach-call_true-termination.c [2018-11-23 11:51:07,586 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/8468a6d6d/fd16a8960e09465fb05c43cc7d9bf4bd/FLAGc5abcafe8 [2018-11-23 11:51:07,598 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/8468a6d6d/fd16a8960e09465fb05c43cc7d9bf4bd [2018-11-23 11:51:07,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:07,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:07,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:07,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:07,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:07,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07, skipping insertion in model container [2018-11-23 11:51:07,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:07,625 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:07,731 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:07,733 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:07,746 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:07,758 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:07,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07 WrapperNode [2018-11-23 11:51:07,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:07,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:07,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:07,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:07,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:07,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:07,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:07,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:07,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... [2018-11-23 11:51:07,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:07,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:07,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:07,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:07,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/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 11:51:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 11:51:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure cast [2018-11-23 11:51:07,878 INFO L138 BoogieDeclarations]: Found implementation of procedure cast [2018-11-23 11:51:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:07,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:07,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:07,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:07,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:08,007 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:08,008 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:51:08,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:08 BoogieIcfgContainer [2018-11-23 11:51:08,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:08,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:08,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:08,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:08,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:07" (1/3) ... [2018-11-23 11:51:08,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a26afab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:08, skipping insertion in model container [2018-11-23 11:51:08,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:07" (2/3) ... [2018-11-23 11:51:08,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a26afab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:08, skipping insertion in model container [2018-11-23 11:51:08,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:08" (3/3) ... [2018-11-23 11:51:08,014 INFO L112 eAbstractionObserver]: Analyzing ICFG cast_union_tight_false-unreach-call_true-termination.c [2018-11-23 11:51:08,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:08,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:08,045 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:08,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:08,072 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:08,072 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:08,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:08,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:08,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:08,073 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:08,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 11:51:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:51:08,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:08,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:08,095 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:08,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:08,100 INFO L82 PathProgramCache]: Analyzing trace with hash 157905740, now seen corresponding path program 1 times [2018-11-23 11:51:08,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:51:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:08,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:51:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:08,218 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=1127219207, |#NULL.offset|=1127219202, |old(#NULL.base)|=1127219207, |old(#NULL.offset)|=1127219202] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=1127219207, |old(#NULL.offset)|=1127219202] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=1127219207, |old(#NULL.offset)|=1127219202] [?] RET #25#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~a~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~a~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := cast(~a~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~i|=0] [?] ~i := #in~i;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8);call write~int(1127219200, ~#x~0.base, ~#x~0.offset, 4);call #t~mem0 := read~int(~#x~0.base, ~#x~0.offset, 4);call write~int(#t~mem0, ~#y~0.base, ~#y~0.offset, 4);havoc #t~mem0;call write~int(-2147483648, ~#x~0.base, 4 + ~#x~0.offset, 4);call #t~mem1 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(~bitwiseXor(~i, #t~mem1), ~#y~0.base, 4 + ~#y~0.offset, 4);havoc #t~mem1;call #t~mem2 := read~real(~#y~0.base, ~#y~0.offset, 8);call #t~mem3 := read~real(~#x~0.base, ~#x~0.offset, 8);#res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3);havoc #t~mem3;havoc #t~mem2;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset);havoc ~#y~0.base, ~#y~0.offset; VAL [cast_~i=0, |#NULL.base|=0, |#NULL.offset|=0, |cast_#in~i|=0] [?] assume true; VAL [cast_~i=0, |#NULL.base|=0, |#NULL.offset|=0, |cast_#in~i|=0] [?] RET #29#return; VAL [main_~a~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=1127219208.0] [?] ~r~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=0, main_~r~0=1127219208.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(~a~0)) then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=1127219207, #NULL.offset=1127219202, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL.base=0, #NULL.offset=0] [L14-L22] ~i := #in~i; [L16] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8); [L16] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8); [L17] call write~int(1127219200, ~#x~0.base, ~#x~0.offset, 4); [L18] call #t~mem0 := read~int(~#x~0.base, ~#x~0.offset, 4); [L18] call write~int(#t~mem0, ~#y~0.base, ~#y~0.offset, 4); [L18] havoc #t~mem0; [L19] call write~int(-2147483648, ~#x~0.base, 4 + ~#x~0.offset, 4); [L20] call #t~mem1 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L20] call write~int(~bitwiseXor(~i, #t~mem1), ~#y~0.base, 4 + ~#y~0.offset, 4); [L20] havoc #t~mem1; [L21] call #t~mem2 := read~real(~#y~0.base, ~#y~0.offset, 8); [L21] call #t~mem3 := read~real(~#x~0.base, ~#x~0.offset, 8); [L21] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L21] havoc ~#x~0.base, ~#x~0.offset; [L16] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L21] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L14-L22] ensures true; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0, ~r~0=1.127219208E9] [L32] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(~a~0)) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L7] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=1127219207, #NULL.offset=1127219202, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL.base=0, #NULL.offset=0] [L14-L22] ~i := #in~i; [L16] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8); [L16] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8); [L17] call write~int(1127219200, ~#x~0.base, ~#x~0.offset, 4); [L18] call #t~mem0 := read~int(~#x~0.base, ~#x~0.offset, 4); [L18] call write~int(#t~mem0, ~#y~0.base, ~#y~0.offset, 4); [L18] havoc #t~mem0; [L19] call write~int(-2147483648, ~#x~0.base, 4 + ~#x~0.offset, 4); [L20] call #t~mem1 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L20] call write~int(~bitwiseXor(~i, #t~mem1), ~#y~0.base, 4 + ~#y~0.offset, 4); [L20] havoc #t~mem1; [L21] call #t~mem2 := read~real(~#y~0.base, ~#y~0.offset, 8); [L21] call #t~mem3 := read~real(~#x~0.base, ~#x~0.offset, 8); [L21] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L21] havoc ~#x~0.base, ~#x~0.offset; [L16] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L21] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L14-L22] ensures true; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0, ~r~0=1.127219208E9] [L32] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(~a~0)) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L7] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8); [L17] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L18] havoc #t~mem0; [L19] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L21] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L21] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L32] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(~a~0)) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L7] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8); [L17] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L18] havoc #t~mem0; [L19] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L21] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L21] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L32] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(~a~0)) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L7] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8); [L17] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L18] havoc #t~mem0; [L19] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L21] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L21] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L32] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(~a~0)) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L7] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8); [L17] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L18] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L18] havoc #t~mem0; [L19] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L20] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L21] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L21] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L32] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(~a~0)) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L7] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L26] int a; [L27] double r; [L29] a = __VERIFIER_nondet_int() [L31] CALL, EXPR cast(a) VAL [\old(i)=0] [L16] union u x, y; [L17] x.i[0] = 0x43300000 [L18] EXPR x.i[0] [L18] y.i[0] = x.i[0] [L19] x.i[1] = 0x80000000 [L20] EXPR x.i[1] [L20] y.i[1] = i ^ x.i[1] [L21] EXPR y.d [L21] EXPR x.d [L21] return y.d - x.d; [L21] return y.d - x.d; [L21] return y.d - x.d; VAL [\old(i)=0, i=0] [L31] RET, EXPR cast(a) VAL [a=0, cast(a)=1127219208] [L31] r = cast(a) [L32] CALL __VERIFIER_assert(r == a) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:51:08,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:51:08 BoogieIcfgContainer [2018-11-23 11:51:08,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:51:08,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:51:08,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:51:08,248 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:51:08,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:08" (3/4) ... [2018-11-23 11:51:08,252 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 11:51:08,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:51:08,253 INFO L168 Benchmark]: Toolchain (without parser) took 652.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:08,254 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:08,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.05 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 11:51:08,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.25 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 11:51:08,255 INFO L168 Benchmark]: Boogie Preprocessor took 55.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:08,256 INFO L168 Benchmark]: RCFGBuilder took 172.72 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:08,257 INFO L168 Benchmark]: TraceAbstraction took 239.24 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:08,257 INFO L168 Benchmark]: Witness Printer took 3.95 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 11:51:08,260 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.05 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 21.25 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 55.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.72 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 239.24 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 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: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 21, overapproximation of bitwiseXor at line 20. Possible FailurePath: [L26] int a; [L27] double r; [L29] a = __VERIFIER_nondet_int() [L31] CALL, EXPR cast(a) VAL [\old(i)=0] [L16] union u x, y; [L17] x.i[0] = 0x43300000 [L18] EXPR x.i[0] [L18] y.i[0] = x.i[0] [L19] x.i[1] = 0x80000000 [L20] EXPR x.i[1] [L20] y.i[1] = i ^ x.i[1] [L21] EXPR y.d [L21] EXPR x.d [L21] return y.d - x.d; [L21] return y.d - x.d; [L21] return y.d - x.d; VAL [\old(i)=0, i=0] [L31] RET, EXPR cast(a) VAL [a=0, cast(a)=1127219208] [L31] r = cast(a) [L32] CALL __VERIFIER_assert(r == a) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 11:51:09,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:09,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:09,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:09,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:09,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:09,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:09,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:09,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:09,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:09,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:09,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:09,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:09,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:09,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:09,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:09,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:09,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:09,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:09,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:09,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:09,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:09,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:09,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:09,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:09,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:09,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:09,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:09,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:09,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:09,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:09,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:09,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:09,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:09,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:09,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:09,688 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 11:51:09,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:09,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:09,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:09,699 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:09,699 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 11:51:09,699 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 11:51:09,699 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 11:51:09,699 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 11:51:09,700 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 11:51:09,700 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 11:51:09,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:09,700 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:51:09,701 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:09,702 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:09,702 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:09,702 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:09,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:09,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:09,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:09,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:09,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:09,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:09,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:09,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:09,703 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 11:51:09,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:09,703 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:51:09,703 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:51:09,704 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_89b06319-ab56-4cc3-95d5-68ae4e759055/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 -> 6c0005e6146056cc1de3f3f086fde77a54c02f63 [2018-11-23 11:51:09,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:09,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:09,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:09,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:09,746 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:09,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/cast_union_tight_false-unreach-call_true-termination.c [2018-11-23 11:51:09,782 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/ceeea335a/0eec63df9e884c99907f31a3d328b1a3/FLAGa2af47a8c [2018-11-23 11:51:10,184 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:10,184 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/sv-benchmarks/c/float-benchs/cast_union_tight_false-unreach-call_true-termination.c [2018-11-23 11:51:10,188 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/ceeea335a/0eec63df9e884c99907f31a3d328b1a3/FLAGa2af47a8c [2018-11-23 11:51:10,197 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/data/ceeea335a/0eec63df9e884c99907f31a3d328b1a3 [2018-11-23 11:51:10,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:10,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:10,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:10,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:10,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:10,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10, skipping insertion in model container [2018-11-23 11:51:10,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:10,223 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:10,339 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:10,342 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:10,357 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:10,374 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:10,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10 WrapperNode [2018-11-23 11:51:10,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:10,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:10,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:10,376 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:10,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:10,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:10,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:10,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:10,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... [2018-11-23 11:51:10,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:10,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:10,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:10,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:10,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/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 11:51:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure cast [2018-11-23 11:51:10,499 INFO L138 BoogieDeclarations]: Found implementation of procedure cast [2018-11-23 11:51:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 11:51:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:10,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:51:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:10,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:10,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:10,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:51:10,760 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:10,760 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:51:10,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:10 BoogieIcfgContainer [2018-11-23 11:51:10,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:10,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:10,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:10,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:10,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:10" (1/3) ... [2018-11-23 11:51:10,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5590e11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:10, skipping insertion in model container [2018-11-23 11:51:10,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:10" (2/3) ... [2018-11-23 11:51:10,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5590e11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:10, skipping insertion in model container [2018-11-23 11:51:10,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:10" (3/3) ... [2018-11-23 11:51:10,765 INFO L112 eAbstractionObserver]: Analyzing ICFG cast_union_tight_false-unreach-call_true-termination.c [2018-11-23 11:51:10,771 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:10,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:10,788 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:10,805 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:10,806 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:10,806 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:10,806 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:10,806 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:10,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:10,806 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:10,806 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:10,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 11:51:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:51:10,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:10,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:10,821 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:10,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:10,824 INFO L82 PathProgramCache]: Analyzing trace with hash 157905740, now seen corresponding path program 1 times [2018-11-23 11:51:10,826 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 11:51:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/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 11:51:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:11,108 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv5 32), |#NULL.offset|=(_ bv1 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] RET #25#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~a~0=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret5 := cast(~a~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv283652 32)] [?] ~i := #in~i;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32);call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32);havoc #t~mem0;call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32);havoc #t~mem1;call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32);call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32);#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3);havoc #t~mem3;havoc #t~mem2;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset);havoc ~#y~0.base, ~#y~0.offset; VAL [cast_~i=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv283652 32), |cast_#res|=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000)] [?] assume true; VAL [cast_~i=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv283652 32), |cast_#res|=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000)] [?] RET #29#return; VAL [main_~a~0=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret5|=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000)] [?] ~r~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=(_ bv283652 32), main_~r~0=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L14-L22] ~i := #in~i; [L16] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L16] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L17] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L18] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L18] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L18] havoc #t~mem0; [L19] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L20] havoc #t~mem1; [L21] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L21] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L21] havoc ~#x~0.base, ~#x~0.offset; [L16] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L21] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L14-L22] ensures true; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L14-L22] ~i := #in~i; [L16] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L16] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L17] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L18] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L18] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L18] havoc #t~mem0; [L19] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L20] havoc #t~mem1; [L21] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L21] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L21] havoc ~#x~0.base, ~#x~0.offset; [L16] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L21] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L14-L22] ensures true; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L26] int a; [L27] double r; [L29] a = __VERIFIER_nondet_int() [L31] CALL, EXPR cast(a) VAL [\old(i)=283652] [L16] union u x, y; [L17] x.i[0] = 0x43300000 [L18] EXPR x.i[0] [L18] y.i[0] = x.i[0] [L19] x.i[1] = 0x80000000 [L20] EXPR x.i[1] [L20] y.i[1] = i ^ x.i[1] [L21] EXPR y.d [L21] EXPR x.d [L21] return y.d - x.d; [L21] return y.d - x.d; [L21] return y.d - x.d; VAL [\old(i)=283652, \result=-0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006019083500988814, i=283652] [L31] RET, EXPR cast(a) VAL [a=283652, cast(a)=-0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006019083500988814] [L31] r = cast(a) [L32] CALL __VERIFIER_assert(r == a) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:51:11,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:51:11 BoogieIcfgContainer [2018-11-23 11:51:11,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:51:11,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:51:11,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:51:11,140 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:51:11,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:10" (3/4) ... [2018-11-23 11:51:11,142 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv5 32), |#NULL.offset|=(_ bv1 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] RET #25#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~a~0=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret5 := cast(~a~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv283652 32)] [?] ~i := #in~i;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32);call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32);havoc #t~mem0;call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32);havoc #t~mem1;call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32);call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32);#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3);havoc #t~mem3;havoc #t~mem2;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset);havoc ~#y~0.base, ~#y~0.offset; VAL [cast_~i=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv283652 32), |cast_#res|=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000)] [?] assume true; VAL [cast_~i=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv283652 32), |cast_#res|=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000)] [?] RET #29#return; VAL [main_~a~0=(_ bv283652 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret5|=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000)] [?] ~r~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=(_ bv283652 32), main_~r~0=(fp #b1 #b00000000000 #b0100010101000000010000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L14-L22] ~i := #in~i; [L16] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L16] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L17] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L18] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L18] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L18] havoc #t~mem0; [L19] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L20] havoc #t~mem1; [L21] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L21] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L21] havoc ~#x~0.base, ~#x~0.offset; [L16] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L21] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L14-L22] ensures true; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L14-L22] ~i := #in~i; [L16] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L16] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L17] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L18] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L18] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L18] havoc #t~mem0; [L19] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L20] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L20] havoc #t~mem1; [L21] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L21] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L21] havoc ~#x~0.base, ~#x~0.offset; [L16] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L21] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L14-L22] ensures true; VAL [#in~i=283652bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L26] havoc ~a~0; [L27] havoc ~r~0; [L29] ~a~0 := #t~nondet4; [L29] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32] [L31] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L14-L22] ~i := #in~i; [L16] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L16] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L17] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L18] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L18] havoc #t~mem0; [L19] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L20] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L20] havoc #t~mem1; [L21] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L21] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L21] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L21] havoc #t~mem3; [L21] havoc #t~mem2; [L16] FCALL call ULTIMATE.dealloc(~#x~0); [L21] havoc ~#x~0; [L16] FCALL call ULTIMATE.dealloc(~#y~0); [L21] havoc ~#y~0; VAL [#in~i=283652bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~i=283652bv32] [L31] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52), ~a~0=283652bv32] [L31] ~r~0 := #t~ret5; [L31] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=283652bv32, ~r~0=~fp~LONGDOUBLE(1bv1, 0bv11, 1218276063444992bv52)] [L32] CALL call __VERIFIER_assert((if ~fp.eq~DOUBLE(~r~0, ~convertINTToDOUBLE(~roundNearestTiesToEven, ~a~0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L7] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L26] int a; [L27] double r; [L29] a = __VERIFIER_nondet_int() [L31] CALL, EXPR cast(a) VAL [\old(i)=283652] [L16] union u x, y; [L17] x.i[0] = 0x43300000 [L18] EXPR x.i[0] [L18] y.i[0] = x.i[0] [L19] x.i[1] = 0x80000000 [L20] EXPR x.i[1] [L20] y.i[1] = i ^ x.i[1] [L21] EXPR y.d [L21] EXPR x.d [L21] return y.d - x.d; [L21] return y.d - x.d; [L21] return y.d - x.d; VAL [\old(i)=283652, \result=-0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006019083500988814, i=283652] [L31] RET, EXPR cast(a) VAL [a=283652, cast(a)=-0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006019083500988814] [L31] r = cast(a) [L32] CALL __VERIFIER_assert(r == a) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:51:11,182 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_89b06319-ab56-4cc3-95d5-68ae4e759055/bin-2019/utaipan/witness.graphml [2018-11-23 11:51:11,182 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:51:11,182 INFO L168 Benchmark]: Toolchain (without parser) took 983.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:11,184 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:11,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.83 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:11,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.21 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:11,185 INFO L168 Benchmark]: Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:11,185 INFO L168 Benchmark]: RCFGBuilder took 346.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:11,185 INFO L168 Benchmark]: TraceAbstraction took 378.40 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.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:11,186 INFO L168 Benchmark]: Witness Printer took 42.44 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:11,188 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.83 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.21 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 346.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 378.40 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.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Witness Printer took 42.44 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int a; [L27] double r; [L29] a = __VERIFIER_nondet_int() [L31] CALL, EXPR cast(a) VAL [\old(i)=283652] [L16] union u x, y; [L17] x.i[0] = 0x43300000 [L18] EXPR x.i[0] [L18] y.i[0] = x.i[0] [L19] x.i[1] = 0x80000000 [L20] EXPR x.i[1] [L20] y.i[1] = i ^ x.i[1] [L21] EXPR y.d [L21] EXPR x.d [L21] return y.d - x.d; [L21] return y.d - x.d; [L21] return y.d - x.d; VAL [\old(i)=283652, \result=-0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006019083500988814, i=283652] [L31] RET, EXPR cast(a) VAL [a=283652, cast(a)=-0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006019083500988814] [L31] r = cast(a) [L32] CALL __VERIFIER_assert(r == a) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...